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

Authors:
Wei Ren;Qing Zhao
Affiliations:
-;-
Venue:
Theoretical Computer Science
Year:
2011

Citing 3
Cited 1

A threshold of ln n for approximating set cover

Journal of the ACM (JACM)
Approximation Algorithms for Connected Dominating Sets

Algorithmica
Algorithms for connected set cover problem and fault-tolerant connected set cover problem

Theoretical Computer Science

Broadcasting in multi-radio multi-channel wireless networks using simplicial complexes

Wireless Networks

Quantified Score

Hi-index	5.23

Visualization

Abstract

A flaw in the greedy approximation algorithm proposed by Zhang et al. (2009) [1] for the minimum connected set cover problem is corrected, and a stronger result on the approximation ratio of the modified greedy algorithm is established. The results are now consistent with the existing results on the connected dominating set problem which is a special case of the minimum connected set cover problem.