preprint · arXiv (Cornell University) · 2011

A Note on: `Algorithms for Connected Set Cover Problem and Fault-Tolerant Connected Set Cover Problem'

Cited by 0Open access

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 this paper

APA 7

Ren, W., & Zhao, Q. (2011). A Note on: `Algorithms for Connected Set Cover Problem and Fault-Tolerant Connected Set Cover Problem'. arXiv (Cornell University). https://doi.org/10.48550/arxiv.1104.0733

MLA 9

Ren, Wei, and Qing Zhao. “A Note on: `Algorithms for Connected Set Cover Problem and Fault-Tolerant Connected Set Cover Problem'.” arXiv (Cornell University), 2011, https://doi.org/10.48550/arxiv.1104.0733.

Chicago

Ren, Wei, and Qing Zhao. 2011. “A Note on: `Algorithms for Connected Set Cover Problem and Fault-Tolerant Connected Set Cover Problem'.” arXiv (Cornell University). https://doi.org/10.48550/arxiv.1104.0733.

Harvard

Ren, W. and Zhao, Q. (2011) ‘A Note on: `Algorithms for Connected Set Cover Problem and Fault-Tolerant Connected Set Cover Problem'’, arXiv (Cornell University). Available at: https://doi.org/10.48550/arxiv.1104.0733.

BibTeX

@misc{ren2011note,
  title = {{A Note on: `Algorithms for Connected Set Cover Problem and Fault-Tolerant Connected Set Cover Problem'}},
  author = {Ren, Wei and Zhao, Qing},
  journal = {arXiv (Cornell University)},
  year = {2011},
  doi = {10.48550/arxiv.1104.0733}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.