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

Theoretical Computer Science

Volumn 410, Issue 8-10, 2009, Pages 812-817

  Zhang, Zhao ^a   Gao, Xiaofeng ^b   Wu, Weili ^b  

^a XINJIANG UNIVERSITY   (China)

^b The University of Texas at Dallas   (United States)

Author keywords

Connected set cover; Fault tolerant; Reserve system

Indexed keywords

ALGORITHMS; CRYOGENIC LIQUIDS; PHOTOVOLTAIC EFFECTS;

CONNECTED GRAPHS; CONNECTED SET COVER; FAULT-TOLERANT; GENERAL GRAPHS; GUARANTEED PERFORMANCE; K-CONNECTED; PERFORMANCE RATIOS; RESERVE SYSTEM; SET COVER PROBLEMS; SUBGRAPH; VERTEX SETS;

APPROXIMATION ALGORITHMS;

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

References (23)

1. Ausiello G., Crescenzi P., Gambosi G., Kann V., Marchetti-Spaccamela A., and Protasi M. Complexity and Approximation (2003), Springer
2. Briers R.A. Incorporating connectivity into reserve selection procedures. Biological Conservation 103 (2002) 77-83
3. Cerdeira J.O., and Pinto L.S. Requiring connectivity in the set covering problem. Journal of Combinatorial Optimization 9 (2005) 35-47
4. Chen D.H., Du D.Z., Hu X.D., Lin G.H., Wang L.S., and Xue G.L. Approximations for Steiner trees with minimum number of Steiner points. Theoretical Computer Science 262 (2001) 83-99
5. T.H. Cormen, C.E. Leiserson, R.L. Rivest, C. Stein, Introduction to Algorithms, second ed.
6. Debinski D.M., and Holt R.D. A survey and overview of habitat fragmentation experiments. Conservation Biology 14 (2000) 342-355
7. Du D.Z., Wang L.S., and Xu B.G. The Euclidean bottleneck Steiner tree and Steiner tree with minimum number of Steiner points. Computing and Combinatorics (Guilin, 2001). Lecture Notes in Computer Science vol. 2108 (2001), Springer, Berlin 509-518
8. Feige U. A threshold of ln n for approximating set cover. Proc. 28th ACM Symposium on Theory of Computing (1996), ACM 314-318
9. Garey M.R., and Johnson D.S. Computers and Intractability (1979), W.H. Freeman and Company, New York
10. Guha S., and Khuller S. Improved methods for approximating node weighted Steiner trees and connected dominating sets. Information and Computation 150 (1999) 57-74
11. Klein P., and Ravi R. A nearly best-possible approximation algorithm for node-weighted Steiner trees. Journal of Algorithms 19 (1995) 104-115
12. Lin G.H., and Xue G. Steiner tree problem with minimum number of Steiner points and bounded edge-length. Information Processing Letters 69 (1999) 53-57
13. Ma ̌ndoiu I.I., and Zelikovsky A.Z. A note on the MST heuristic for bounded edge-length Steiner trees with minimum number of Steiner points. Information Processing Letters 75 (2000) 165-167
14. McDonnell M.D., Possingham H.P., Ball I.R., and Cousins E.A. Mathematical methods for spatially cohesive reserve design. Environmental Modeling and Assessment 7 (2002) 107-114
15. Nalle D.J., Arthur J.L., and Sessions J. Designing compact and contiguous reserve networks ith a hybrid heuristic approach. Forest Science 48 (2002) 59-68
16. Nicholls A.O., and Margules C.R. An upgraded reserve selection algorithm. Biological Conservation 64 (1993) 165-169
17. Önal H., and Briers R.A. Incorporating spatial criteria in optimum reserve network selection. Proceedings of the Royal Society, London B 269 (2002) 2437-2441
18. Önal H., and Briers R.A. Selection of a minimum-boundary reserve network using integer programming. Proceedings of the Royal Society, London B 270 (2003) 1487-1491
19. Possingham H., Ball I., and Andelman S. Mathematical methods for identifying representative reserve networks. In: Ferson S., and Burgman M. (Eds). Quantitative Methods for Conservation Biology (2000), Springer, New York 291-306
20. Shuai T.P., and Hu X.D. Connected set cover problem and its applications. International conference on algorithmic aspects in information and management, Hong Kong, China. Lecture Notes in Computer Science vol. 4041 (2006) 243-254
21. Siitonen P., Tanskanen A., and Lehtinen A. Selecting forest reserves with a multi-objective spatial algorithm. Environmental Science and Policy 6 (2003) 301-309
22. Suurballe J.W., and Tarjan R.E. A quick method for finding shortest pairs of disjoint paths. Networks 14 (1984) 325-336
23. F. Zou, X.Y. Li, D. Kim, W.L. Wu, Two constant approximation algorithms for node-weighted Steiner tree in nnit disk graphs, in: 2nd Annual International Conference on Combinatorial Optimization and Application, St. John's, Newfoundland, 2008