A Note on: `Algorithms for Connected Set Cover Problem and Fault-Tolerant Connected Set Cover Problem'
Data Structures and Algorithms
2015-03-19 v1
Abstract
A flaw in the greedy approximation algorithm proposed by Zhang et al. for 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 connected dominating set problem which is a special case of the minimum connected set cover problem.
Cite
@article{arxiv.1104.0733,
title = {A Note on: `Algorithms for Connected Set Cover Problem and Fault-Tolerant Connected Set Cover Problem'},
author = {Wei Ren and Qing Zhao},
journal= {arXiv preprint arXiv:1104.0733},
year = {2015}
}
Comments
6 pages, 1 figure, submitted to Theoretical Computer Science