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

@article{Zhang2009AlgorithmsFC,
  title={Algorithms for connected set cover problem and fault-tolerant connected set cover problem},
  author={Zhao Zhang and Xiaofeng Gao and Weili Wu},
  journal={Theor. Comput. Sci.},
  year={2009},
  volume={410},
  pages={812-817}
}
Given a set V of elements, S a family of subsets of V , and G a connected graph on vertex set S,a connected set cover (CSC) is a subfamily R of S such that every element in V is covered by at least one set of R, and the subgraph G[R] of G induced by R is connected. If furthermore G[R] is k-connected and every element in V is covered by at least m sets inR, thenR is a (k,m)-CSC. In this paper, we present two approximation algorithms for theminimumCSC problem, and one approximation algorithm for… CONTINUE READING
Highly Cited
This paper has 35 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 16 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 22 references

D

F. Zou, X. Y. Li
Kim,W.L.Wu, Two constant approximation algorithms for node-weighted Steiner tree in nnit disk graphs, in: 2ndAnnual International Conference on Combinatorial Optimization and Application, St. John’s, Newfoundland • 2008
View 1 Excerpt

Selecting forest reserves with a multi-objective spatial algorithm

P. Siitonen, A. Tanskanen, A. Lehtinen
Environmental Science and Policy 6 • 2003
View 1 Excerpt

Designing compact and contiguous reserve networks ith a hybrid heuristic approach

D. J. Nalle, J. L. Arthur, J. Sessions
Forest Science 48 • 2002
View 1 Excerpt

Incorporating connectivity into reserve selection procedures

R. A. Briers
Biological Conservation 103 • 2002
View 1 Excerpt

Similar Papers

Loading similar papers…