Approximation Algorithms for the Covering Steiner Problem

Random Structures and Algorithms

Volumn 20, Issue 3, 2002, Pages 465-482

  Konjevod, Goran ^a   Ravi, R ^b   Srinivasan, Aravind ^c  

^a Arizona State University   (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

^c UNIVERSITY OF MARYLAND   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0036106499     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/rsa.10038     Document Type: Conference Paper

References (20)

1. S. Arora and G. Karakostas, A 2 + ε approximation algorithm for the k-MST problem, Proc 11th Annu ACM-SIAM Symp Discrete Alg, 2000, pp. 754-759.
2. S. Arya and H. Ramesh, A 2.5-factor approximation algorithm for the k-MST problem, Inf Process Lett 65 (1998), 117-118.
3. Y. Bartal, Probabilistic approximation of metric spaces and its algorithmic applications, Proc 37th Annu IEEE Symp Found Comput Sci October 1996, pp. 184-193.
4. Y. Bartal, On approximating arbitrary metrics by tree metrics, Proc 30th Annu ACM Symp Theory Comput 1998, pp. 161-168.
5. A. Blum, R. Ravi, and S. Vempala, A constant-factor approximation for the k-MST problem, Proc 28th Annu ACM Symp Theory Comput, 1996, pp. 442-448.
6. M. Charikar, C. Chekuri, A. Goel, and S. Guha, Rounding via trees: Deterministic approximation algorithms for group Steiner trees and k-median, Proc 30th Annu ACM Symp Theory Comput, 1998, pp. 114-123.
7. M. Charikar, C. Chekuri, A. Goel, S. Guha, and S. Plotkin, Approximating a finite metric by a small number of tree metrics, Proc 39th Annu IEEE Symp Found Comput Sci, 1998, pp. 379-388.
8. G. Even, G. Kortsarz, and W. Slany, On network design problems: Fixed cost flow and the covering Steiner problem, manuscript, May 2001.
9. M. Fischetti, H. W. Harnacher, K. Jørnsten, and F. Maffioli, Weighted k-cardinality trees: complexity and polyhedral structure, Networks 24 (1994), 11-21.
10. N. Garg, A 3-approximation for the minimum tree spanning k vertices, Proc 37th Annu IEEE Symp Found Comput Sci, October 1996, pp. 302-309.
11. N. Garg, Personal communication, September 1999.
12. N. Garg, G. Konjevod, and R. Ravi, A polylogarithmic approximation algorithm for the group Steiner tree problem, Proc 9th Annu ACM-SIAM Symp Discrete Alg, 1998, pp. 253-259.
13. M. Grötschel, L. Lovász, and A. Schrijver, Geometric algorithms and combinatorial optimization, Springer-Verlag, New York, 1988.
14. S. Janson, Poisson approximations for large deviations, Random Struct Alg 1 (1990), 221-230.
15. P. N. Klein and R. Ravi, A nearly best-possible approximation algorithm for node-weighted Steiner tree, J Alg 19 (1995), 104-115.
16. G. Konjevod and R. Ravi, An approximation algorithm for the covering Steiner problem, Proc 11th Annu ACM-SIAM Symp Discrete Alg, 2000, pp. 338-344.
17. G. Konjevod, R. Ravi, and F. S. Salman, On approximating planar metrics by tree metrics, Inf Process Lett 80 (2001), 213-219.
18. R. Ravi, R. Sundaram, M. V. Marathe, D. Rosenkrantz, and S. S. Ravi, Spanning trees - short or small, SIAM J Discrete Math 9 (1996), 178-200.
19. G. Reich and P. Widmayer, Beyond Steiner's problem: A VLSI oriented generalization, Graph-theoretic concepts in computer science WG89, Lecture Notes in Computer Science Vol. 411, Springer-Verlag, New York, 1990, pp. 196-210.
20. A. Srinivasan, New approaches to covering and packing problems, Proc 12th Annu ACM-SIAM Symp Discrete Alg, 2001, pp. 567-576.