Integrality ratio for group steiner trees and directed Steiner trees

SIAM Journal on Computing

Volumn 36, Issue 5, 2006, Pages 1494-1511

  Halperin, Eran ^a   Kortsarz, Guy ^b   Krauthgamer, Robert ^c   Srinivasan, Aravind ^d   Wang, Nan ^e  

^a INTERNATIONAL COMPUTER SCIENCE INSTITUTE   (United States)

^b RUTGERS UNIVERSITY   (United States)

^c IBM ALMADEN RESEARCH CENTER   (United States)

^d University of Maryland ^*  (United States)

^e MORGAN STANLEY   (United States)

Author keywords

Approximation algorithms; Directed Steiner tree; Flow based relaxation; Group Steiner tree; Integrality ratio; Linear programming relaxation

Indexed keywords

DIRECTED STEINER TREE; FLOW BASED RELAXATION; GROUP STEINER TREE; INTEGRALITY RATIO;

APPROXIMATION ALGORITHMS; HIERARCHICAL SYSTEMS; INTEGRATION; LINEAR PROGRAMMING; PROBLEM SOLVING; THEOREM PROVING;

TREES (MATHEMATICS);

EID: 35448936505     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539704445718     Document Type: Article

References (21)

1. Y. BARTAL, Probabilistic approximation of metric spaces and its algorithmic applications, in Proceedings of the 37th Annual IEEE Symposium on Foundations of Computer Science, 1996, pp. 184-193.
2. Y. BARTAL, On approximating arbitrary metrics by tree metrics, in Proceedings of the 30th Annual ACM Symposium on Theory of Computing, 1998, pp. 161-168.
3. Y. BARTAL, B. BOLLOBÁS, AND M. MENDEL, A Ramsey-type theorem for metric spaces and its applications for metrical task systems and related problems, in Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science, 2001, pp. 396-405.
4. Y. BARTAL AND M. MENDEL, Multiembedding of metric spaces, SIAM J. Comput., 34 (2004), pp. 248-259.
5. M. CHARIKAR, C. CHEKURI, T. CHEUNG, Z. DAI, A. GOEL, S. GUHA, AND M. LI, Approximation algorithms for directed Steiner problems, J. Algorithms, 33 (1999), pp. 73-91.
6. M. CHARIKAR, C. CHEKURI, A. GOEL, AND S. GUHA, Rounding via trees: Deterministic approximation algorithms for group Steiner trees and k-median, in Proceedings of the 30th Annual ACM Symposium on Theory of Computing, 1998, pp. 114-123.
7. C. CHEKURI, G. EVEN, AND G. KORTSARZ, A greedy approximation algorithm for the Group Steiner problem, Discrete Appl. Math., 154 (2006), pp. 15-34.
8. J. CHUZHOY, S. GUHA, E. HALPERIN, S. KHANNA, G. KORTSARZ, R. KRAUTHGAMER, AND J. NAOR, Asymmetric k-center is log* n-hard to approximate, J. ACM, 52 (2005), pp. 538-551.
9. U. FEIGE, A threshold of In n for approximating set cover, J. ACM, 45 (1998), pp. 634-652.
10. J. FAKCHAROENPHOL, S. RAO, AND K. TALWAR, A tight bound on approximating arbitrary metrics by tree metrics, J. Comput. System Sci., 69 (2004), pp. 485-497.
11. N. GARG, G. KONJEVOD, AND R. RAVI, A polylogarithmic approximation algorithm for the Group Steiner tree problem, J. Algorithms, 37 (2000), pp. 66-84.
12. A. GUPTA AND A. SRINIVASAN, An improved approximation ratio for the covering Steiner problem, Theory of Computing, 2 (2006), pp. 53-64.
13. E. HALPERIN AND R. KRAUTHGAMER, Polylogarithmic inapproximability, in Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003, pp. 585-594.
14. S. JANSON, Poisson approximations for large deviations, Random Structures Algorithms, 1 (1990), pp. 221-230.
15. G. KONJEVOD, R. RAVI, AND F. S. SALMAN, On approximating planar metrics by tree metrics, Inform. Process. Lett., 80 (2001), pp. 213-219.
16. G. KONJEVOD, R. RAVI, AND A. SRINIVASAN, Approximation algorithms for the covering Steiner problem, Random Structures Algorithms, 20 (2002), pp. 465-482.
17. C. LUND AND M. YANNAKAKIS, On the hardness of approximating minimization problems, J. ACM, 41 (1994), pp. 960-981.
18. R. MOTWANI AND P. RAGHAVAN, Randomized Algorithms, Cambridge University Press, Cambridge, UK, 1995.
19. R. RAZ AND S. SAFRA, A sub-constant error-probability low-degree test, and a subconstant error-probability PCP characterization of NP, in Proceedings of the 29th Annual ACM Symposium on Theory of Computing, 1997, pp. 475-484.
20. A. SRINIVASAN, New approaches to covering and packing problems, in Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms, 2001, pp. 567-576.
21. L. ZOSIN AND S. KHULLER, On directed Steiner trees, in Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002, pp. 59-63.