Set connectivity problems in undirected graphs and the directed Steiner network problem

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2008, Pages 532-541

  Chekuri, Chandra ^a   Even, Guy ^b   Gupta, Anupam ^c   Segev, Danny ^c  

^a University of Illinois at Urbana Champaign   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

^c Carnegie Mellon University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION RATIOS; CONNECTIVITY PROBLEMS; FACILITY LOCATIONS; GROUP STEINER TREE; MULTICAST; NETWORK FORMATIONS; OPEN PROBLEMS; PERFORMANCE GUARANTEES; POLYLOGARITHMIC APPROXIMATION; STEINER NETWORK; SUB GRAPHS; WORST CASE;

FACILITIES; GRAPH THEORY;

APPROXIMATION ALGORITHMS;

EID: 58449134357     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

1. A. Agrawal, P. N. Klein, and R. Ravi. When trees collide: An approximation algorithm for the generalized Steiner problem on networks. SIAM Journal on Computing, 24(3):440-456, 1995.
2. N. Alon, B. Awerbuch, Y. Azar, N. Buchbinder, and J. Naor. A general approach to online network optimization problems. ACM Transactions on Algorithms, 2(4):640-660, 2006.
3. Y. Bartal. Probabilistic approximations of metric spaces and its algorithmic applications. In Proceedings of the 37th Annual Symposium on Foundations of Computer Science, pages 184-193, 1996.
4. Y. Bartal. On approximating arbitrary metrices by tree metrics. In Proceedings of the 30th Annual ACM Symposium on the Theory of Computing, pages 161-168, 1998.
5. M. Charikar, C. Chekuri, T.-Y. Cheung, Z. Dai, A. Goel, S. Guha, and M. Li. Approximation algorithms for directed Steiner problems. Journal of Algorithms, 33(1):73-91, 1999.
6. C. Chekuri, M. T. Hajiaghayi, G. Kortsarz, and M. R. Salavatipour. Approximation algorithms for non-uniform buy-at-bulk network design. In Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science, pages 677-686, 2006.
7. C. Chekuri, M. T. Hajiaghayi, G. Kortsarz, and M. R. Salavatipour. Approximation algorithms for nodeweighted buy-at-bulk network design. In Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 1265-1274, 2007.
8. Y. Dodis and S. Khanna. Design networks with bounded pairwise distance. In Proceedings of the 31st Annual ACM Symposium on Theory of Computing, pages 750-759, 1999.
9. J. Fakcharoenphol, S. Rao, and K. Talwar. A tight bound on approximating arbitrary metrics by tree metrics. Journal of Computer and System Sciences, 69(3):485-497, 2004.
10. T. Fukunaga and H. Nagamochi. The set connector problem in graphs. In Proceedings of the 12th International Conference on Integer Programming and Combinatorial Optimization, pages 484-498, 2007.
11. N. Garg, G. Konjevod, and R. Ravi. A polylogarithmic approximation algorithm for the group Steiner tree problem. Journal of Algorithms, 37(1):66-84, 2000.
12. M. X. Goemans and D. P. Williamson. A general approximation technique for constrained forest problems. SIAM Journal on Computing, 24(2):296-317, 1995.
13. M. X. Goemans and D. P. Williamson. The primaldual method for approximation algorithms and its application to network design problems. In D. S. Hochbaum, editor, Approximation Algorithms for NP-Hard Problems. PWS Publishing Company, 1996.
14. M. T. Hajiaghayi, G. Kortsarz, and M. R. Salavatipour. Approximating buy-at-bulk and shallowlight k-Steiner trees. In Proceedings of the 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, pages 152-163, 2006.
15. E. Halperin, G. Kortsarz, R. Krauthgamer, A. Srinivasan, and N. Wang. Integrality ratio for group Steiner trees and directed Steiner trees. SIAM Journal on Computing, 36(5):1494-1511, 2007.
16. E. Halperin and R. Krauthgamer. Polylogarithmic inapproximability. In Proceedings of the 35th Annual ACM Symposium on Theory of Computing, pages 585-594, 2003.
17. D. S. Hochbaum, editor. Approximation Algorithms for NP-Hard Problems. PWS Publishing Company, 1996.
18. D. S. Johnson. Approximation algorithms for combinatorial problems. Journal of Computer and System Sciences, 9(3):256-278, 1974.
19. V. V. Vazirani. Approximation Algorithms. Springer, 2001.
20. A. Zelikovsky. A series of approximation algorithms for the acyclic directed Steiner tree problem. Algorithmica, 18(1):99-110, 1997.
21. L. Zosin and S. Khuller. On directed Steiner trees. In Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 59-63, 2002.