Network design for vertex connectivity

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2008, Pages 167-176

  Chakraborty, Tanmoy ^a   Chuzhoy, Julia ^b   Khanna, Sanjeev ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b TOYOTA TECHNOLOGICAL INSTITUTE AT CHICAGO   (United States)

Author keywords

Approximation algorithms; Hardness of approximation; Network design; Vertex connectivity

Indexed keywords

APPROXIMATION ALGORITHMS; APPROXIMATION THEORY; COMPUTATION THEORY; LINEAR PROGRAMMING;

ELEMENTARY CONSTRUCTION; HARDNESS OF APPROXIMATION; INTEGRALITY GAPS; LINEAR PROGRAMMING RELAXATION; LOGARITHMIC APPROXIMATION; NETWORK DESIGN; SURVIVABLE NETWORK DESIGN; VERTEX CONNECTIVITY;

GRAPH THEORY;

EID: 57049136166     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1374376.1374403     Document Type: Conference Paper

References (24)

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. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and the hardness of approximation problems. Journal of the ACM, 45(3):501-555, 1998.
3. S. Arora and S. Safra. Probabilistic checking of proofs: A new characterization of NP. Journal of the ACM, 45(1):70-122, 1998.
4. 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(l):21-30, 1999.
5. M. Bern and P. Plassmann. The steiner problem with edge lengths 1 and 2. Information Processing Letters, 32:171-176, 1989.
6. J. Cheriyan, T. Jordan, and Z. Nutov. On rooted node-connectivity problems. Algorithmica, 30(3):353-375, 2001.
7. 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.
8. J. Cheriyan, S. Vempala, and A. Vetta. Network design via iterative rounding of setpair relaxations. Combinatorial, 26(3):255-275, 2006.
9. Y. Dinitz and Z. Nutov. A 3-approximation algorithm for finding optimum 4, 5-vertex-connected spanning subgraphs. Journal of Algorithms, 32(l):31-40, 1999.
10. 2 k)-approximation algorithm for the k-vertex connected subgraph problem. In STOC 2008, to appear.
11. 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.
12. A. Frank and T. Jordan. Minimal edge-coverings of pairs of sets. Journal of Combinatorial Theory, Series B, 65(1):73-110, 1995.
13. A. Frank and E. Tardos. An application of submodular flows. Linear Algebra and its Applications, 114-115:329-348, 1989.
14. 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.
15. M. X. Goemans, A. V. Goldberg, É. T. 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.
16. 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.
17. 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.
18. S. Khuller and B. Raghavachari. Improved approximation algorithms for uniform connectivity problems. Journal of Algorithms, 21(2):434-450, 1996.
19. 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.
20. G. Kortsarz and Z. Nutov. Approximating node connectivity problems via set covers. Algorithmica, 37(2):75-92, 2003.
21. G. Kortsarz and Z. Nutov. Approximating k-node connected subgraphs via critical graphs. SIAM Journal of Computing, 35(1):247-257, 2005.
22. W. Mader. Endlichkeitsätze für k-kritische graphen (german). Mathematische Annalen, 229:143-153, 1977.
23. R. Ravi and D. P. Williamson. An approximation algorithm for minimum-cost vertex-connectivity problems. Algorithmica, 18(1):21-43, 1997.
24. R. Raz. A parallel repetition theorem. SIAM Journal of Computing, 27(3):763-803, 1998.