Algorithms for single-source vertex connectivity

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2008, Pages 105-114

  Chuzhoy, Julia ^a   Khanna, Sanjeev ^b  

^a TOYOTA TECHNOLOGICAL INSTITUTE AT CHICAGO   (United States)

^b UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMIC TECHNIQUES; DISJOINT COLLECTIONS; GENERAL NETWORKS; MINIMUM COSTS; REROUTING SCHEMES; VERTEX CONNECTIVITIES;

COMPUTERS; FIBER OPTIC CHEMICAL SENSORS; POLYNOMIAL APPROXIMATION; PORT TERMINALS;

APPROXIMATION ALGORITHMS;

EID: 57949083140     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2008.63     Document Type: Conference Paper

References (26)

1. A. Agrawal, P. N. Klein, and R. Ravi. When trees collide: An approximation algorithm for the generalized steiner problem on networks. SIAM Journal of Computing, 24(3):440-456, 1995.
2. V. Auletta, Y. Dinitz, Z. Nutov, and D. Parente. A 2-approximation algorithm for finding an optimum 3-vertex-connected spanning subgraph. Journal of Algorithms, 32(1):21-30, 1999.
3. M. Bern and P. Plassmann. The steiner problem with edge lengths 1 and 2. Information Processing Letters, 32:171-176, 1989.
4. J. Cheriyan, T. Jordan, and Z. Nutov. On rooted node-connectivity problems. Algorithmica, 30(3):353-375, 2001.
5. J. Cheriyan, S. Vempala, and A. Vetta. An approximation algorithm for the minimum-cost k-vertex connected subgraph. SIAM Journal of Computing, 32(4): 1050-1055, 2003.
6. J. Cheriyan, S. Vempala, and A. Vetta. Network design via iterative rounding of setpair relaxations. Combinatorica, 26(3):255-275, 2006.
7. T. Chakraborty, J. Chuzhoy, and S. Khanna. Network Design for Vertex Connectivity. In Proceedings of ACM Symposium on Theory of Computing (STOC), 2008.
8. C. Chekuri and N. Korula. Single-sink network design with vertex connectivity Requirements. Manuscript, April 2008.
9. J. Chuzhoy and S. Khanna. Algorithms for single-source vertex connectivity. Available at http://ttic.uchicago.edu/~cjulia/ and http://www.cis.upenn.edu/~sanjeev/.
10. Y. Dinitz and Z. Nutov. A 3-approximation algorithm for finding optimum 4, 5-vertex-connected spanning subgraphs. Journal of Algorithms, 32(1):31-40, 1999.
11. 2 k)-approximation algorithm for the k-vertex connected subgraph problem. In Proceedings of ACM Symposium on Theory of Computing (STOC), 2008.
12. U. Feige. A threshold of In n for approximating set cover. Journal of the ACM 45(4) pp. 634-652, 1998.
13. L. Fleischer, K. Jain, and D. P. Williamson. Iterative rounding 2-approximation algorithms for minimum cost vertex connectivity problems. Journal of Computer and System Sciences, 72(5):838-867, 2006.
14. A. Frank and T. Jordan. Minimal edge-coverings of pairs of sets. Journal of Combinatorial Theory, Series B, 65(1):73-110, 1995.
15. A. Frank and E. Tardos. An application of submodular flows. Linear Algebra and its Applications, 114-115:329-348, 1989.
16. M. Goemans and D. Williamson. The primal-dual method for approximation algorithms and its application to network design problems. In Approximation Algorithms, D. Hochbaum, Ed., PWS, 1997.
17. M. X. Goemans, A. V. Goldberg, É. Tardos, S. A. Plotkin, D. B. Shmoys, and D. P. Williamson. Improved approximation algorithms for network design problems. In Proceedings of the fifth annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 223-232, 1994.
18. M. X. Goemans, M. Mihail, V. Vazirani, and D. P. Williamson. A primal-dual approximation algorithm for generalized steiner network problems. Combinatorica, 15(3):435-454, 1995.
19. K. Jain. Factor 2 approximation algorithm for the generalized steiner network problem. In Proceedings of the thirty-ninth annual IEEE Foundations of Computer Science (FOCS), pages 448-457, 1998.
20. S. Khuller and B. Raghavachari. Improved approximation algorithms for uniform connectivity problems. Journal of Algorithms, 21(2):434-450, 1996.
21. P. N. Klein and R. Ravi. A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees. Journal of Algorithms, 19 (1): 104-115, 1995.
22. G. Kortsarz, R. Krauthgamer, and J. R. Lee. Hardness of approximation for vertex-connectivity network design problems. SIAM Journal of Computing, 33(3):704-720, 2004.
23. G. Kortsarz and Z. Nutov. Approximating node connectivity problems via set covers. Algorithmica, 37(2):75-92, 2003.
24. G. Kortsarz and Z. Nutov. Approximating k-node connected subgraphs via critical graphs. SIAM Journal of Computing, 35(1):247-257, 2005.
25. C. Lund, and M. Yannakakis. On the hardness of approximating minimization problems. J.ACM 41, 5, 960-981, 1994.
26. R. Ravi and D. P. Williamson. An approximation algorithm for minimum-cost vertex-connectivity problems. Algorithmica, 18(1):21-43, 1997.