A note on 'Algorithms for connected set cover problem and fault-tolerant connected set cover problem'

Theoretical Computer Science

Volumn 412, Issue 45, 2011, Pages 6451-6454

  Ren, Wei ^a   Zhao, Qing ^a  

^a University of California   (United States)

Author keywords

Approximation ratio; Connected set cover; Greedy algorithm

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER SCIENCE;

APPROXIMATION RATIOS; CONNECTED DOMINATING SET PROBLEMS; CONNECTED SET COVER; FAULT-TOLERANT; GREEDY ALGORITHMS; GREEDY APPROXIMATION ALGORITHMS;

APPROXIMATION ALGORITHMS;

EID: 83355173279     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2011.07.008     Document Type: Article

References (3)

1. Z. Zhang, X.F. Gao, W.L. Wu, Algorithms for connected set cover problem and fault-tolerant connected set cover problem, Theoretical Computer Science 410 (8-10) (2009) 812-817.
2. U. Feige, A threshold of lnn for approximating set cover, Journal of the ACM 45 (4) (1998) 634-652.
3. S. Guha, S. Khuller, Approximation algorithms for connected dominating sets, Algorithmica 20 (4) (1998) 374-387.