On-line algorithms for the dominating set problem

被引：0
|
作者：
Dept. of Comp. and Info. Science, National Chiao Tung University, Hsinchu 30050, Taiwan [1 ]
机构：
来源：
Inf. Process. Lett. | / 1卷 / 11-14期
关键词：
* Corresponding author. Email: tzeng@cis.nctu.edu.tw. I This research was supported in part by the National Science Council; Taiwan; R.O.C; under grant NSC 86-2213-E-009-024;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
7
引用
收藏
相关论文
共 50 条
  • [31] Algorithms for the minimum weight k-fold (connected) dominating set problem
    Wenkai Ma
    Deying Li
    Zhao Zhang
    [J]. Journal of Combinatorial Optimization, 2012, 23 : 528 - 540
  • [32] Algorithms for Steiner Connected Dominating Set Problem Based on Learning Automata Theory
    Torkestani, Javad Akbari
    [J]. INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2015, 26 (06) : 769 - 801
  • [33] New Algorithms for Mixed Dominating Set
    Dublois, Louis
    Lampis, Michael
    Paschos, Vangelis Th
    [J]. DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2021, 23 (01):
  • [34] Exponential Time Algorithms for the Minimum Dominating Set Problem on Some Graph Classes
    Gaspers, Serge
    Kratsch, Dieter
    Liedloff, Mathieu
    Todinca, Ioan
    [J]. ACM TRANSACTIONS ON ALGORITHMS, 2009, 6 (01)
  • [35] Algorithms for the minimum weight k-fold (connected) dominating set problem
    Ma, Wenkai
    Li, Deying
    Zhang, Zhao
    [J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2012, 23 (04) : 528 - 540
  • [36] Improved randomized on-line algorithms for the list update problem
    Albers, S
    [J]. SIAM JOURNAL ON COMPUTING, 1998, 27 (03) : 682 - 693
  • [37] Simple On-Line Algorithms for the Maximum Disjoint Paths Problem
    Petr Kolman
    Christian Scheideler
    [J]. Algorithmica , 2004, 39 : 209 - 233
  • [38] Simple on-line algorithms for the maximum disjoint paths problem
    Kolman, P
    Scheideler, C
    [J]. ALGORITHMICA, 2004, 39 (03) : 209 - 233
  • [39] On-line algorithms for the channel assignment problem in cellular networks
    Crescenzi, P
    Gambosi, G
    Penna, P
    [J]. DISCRETE APPLIED MATHEMATICS, 2004, 137 (03) : 237 - 266
  • [40] Approximation algorithms for the b-edge dominating set problem and its related problems
    Fukunaga, T
    Nagamochi, H
    [J]. COMPUTING AND COMBINATORICS, PROCEEDINGS, 2005, 3595 : 747 - 756
12345