Hardness of approximation for vertex-connectivity network design problems

SIAM Journal on Computing

Volumn 33, Issue 3, 2004, Pages 704-720

  Kortsarz, Guy ^a   Krauthgamer, Robert ^b,d   Lee, James R ^c  

^a RUTGERS UNIVERSITY   (United States)

^b INTERNATIONAL COMPUTER SCIENCE INSTITUTE   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

^d IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

Approximation algorithms; Connectivity augmentation; Hardness of approximation; Survivable network design; Vertex connectivity

Indexed keywords

APPROXIMATION ALGORITHMS; CONNECTIVITY AUGMENTATION; HARDNESS OF APPROXIMATION; SURVIVABLE NETWORK DESIGNS; VERTEX CONNECTIVITY;

ALGORITHMS; APPROXIMATION THEORY; BOUNDARY VALUE PROBLEMS; GRAPH THEORY; MATHEMATICAL MODELS; PROBLEM SOLVING; THEOREM PROVING;

SCHEMATIC DIAGRAMS;

EID: 3142717683     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539702416736     Document Type: Article

References (35)

1. S. ARORA AND C. LUND, Hardness of approximations, in Approximation Algorithms for NP-Hard Problems, D. Hochbaum, ed., PWS Publishing, Boston, 1996.
2. V. AULETTA, Y. DINITZ, Z. NUTOV, AND D. PARENTE, A 2-approximation algorithm for finding an optimum 3-vertex-connected spanning subgraph, J. Algorithms, 32 (1999), pp. 21-30.
3. J. CHERIYAN, T. JORDÁN, AND Z. NUTOV, On rooted node-connectivity problems, Algorithmica, 30 (2001), pp. 353-375.
4. J. CHERIYAN AND R. THURIMELLA, Approximating minimum-size k-connected spanning subgraphs via matching, SIAM J. Comput., 30 (2000), pp. 528-560.
5. J. CHERIYAN, S. VEMPALA, AND A. VETTA, Approximation algorithms for minimum-cost k-vertex connected subgraphs, in 34th Annual ACM Symposium on Theory of Computing, Montreal, Quebec, Canada, 2002, pp. 306-312.
6. B. CSABA, M. KARPINSKI, AND P. KRYSTA, Approximability of dense and sparse instances of minimum 2-connectivity, TSP and path problems, in Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, ACM, New York, SIAM, Philadelphia, 2002, pp. 74-83.
7. A. CZUMAJ AND A. LINGAS, On approximability of the minimum-cost k-connected spanning subgraph problem, in Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, ACM, New York, SIAM, Philadelphia, 1999, pp. 281-290.
8. R. DIESTEL, Graph Theory, 2nd ed., Springer-Verlag, New York, 2000.
9. Y. DINITZ AND Z. NUTOV, A 3-approximation algorithm for finding optimum 4, 5-vertex-connected spanning subgraphs, J. Algorithms, 32 (1999), pp. 31-40.
10. I. DINUR AND S. SAFRA, On the hardness of approximating label cover, Technical report TR99-015, Electronic Colloquium on Computational Complexity, 1999.
11. K. P. ESWARAN AND R. E. TARJAN, Augmentation problems, SIAM J. Comput., 5 (1976), pp. 653-665.
12. U. FEIGE, A threshold of ln n for approximating set cover, J. ACM, 45 (1998), pp. 634-652.
13. U. FEIGE, M. M. HALLDÓRSSON, G. KORTSARZ, AND A. SRINIVASAN, Approximating the domatic number, SIAM J. Comput., 32 (2002), pp. 172-195.
14. L. FLEISCHER, K. JAIN, AND D. P. WILLIAMSON, An iterative rounding 2-approximation algorithm for the element connectivity problem, in 42nd Annual IEEE Symposium on Foundations of Computer Science, Los Alamitos, CA, 2001, IEEE Computer Society, pp. 339-347.
15. A. FRANK, Connectivity augmentation problems in network design, in Mathematical Programming: State of the Art 1994, J. R. Birge and K. G. Murty, eds., The University of Michigan, Ann Arbor, MI, 1994, pp. 34-63.
16. A. FRANK AND É. TARDOS, An application of submodular flows, Linear Algebra Appl., 114/115 (1989), pp. 329-348.
17. G. N. FREDERICKSON AND J. JA'JA', Approximation algorithms for several graph augmentation problems, SIAM J. Comput., 10 (1981), pp. 270-283.
18. T. HSU, On four-connecting a triconnected graph, J. Algorithms, 35 (2000), pp. 202-234.
19. T. HSU AND V. RAMACHANDRAN, A linear time algorithm for triconnectivity augmentation, in 32nd Annual IEEE Symposium on Foundations of Computer Science, San Juan, Puerto Rico, 1991, IEEE Computer Society, pp. 548-559.
20. K. JAIN, A factor 2 approximation algorithm for the generalized Steiner network problem, Combinatorica, 21 (2001), pp. 39-60.
21. K. JAIN, I. MǍNDOIU, V. V. VAZIRANI, AND D. P. WILLIAMSON, A primal-dual schema based approximation algorithm for the element connectivity problem, in Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, ACM, New York, SIAM, Philadelphia, 1999, pp. 484-489.
22. T. JORDÁN, On the optimal vertex-connectivity augmentation, J. Combin. Theory Ser. B, 63 (1995), pp. 8-20.
23. V. KANN, S. KHANNA, J. LAGERGREN, AND A. PANCONESI, On the hardness of approximating MAX k-CUT and its dual, Chicago J. Theoret. Comput. Sci., 1997 (1997), Article 2.
24. S. KHULLER, Approximation algorithms for finding highly connected subgraphs, in Approximation Algorithms for NP-Hard Problems, D. Hochbaum, ed., PWS Publishing, Boston, 1996.
25. S. KHULLER AND B. RAGHAVACHARI, Improved approximation algorithms for uniform connectivity problems, J. Algorithms, 21 (1996), pp. 434-450.
26. S. KHULLER AND R. THURIMELLA, Approximation algorithms for graph augmentation, J. Algorithms, 14 (1993), pp. 214-225.
27. G. KORTSARZ, On the hardness of approximating spanners, Algorithmica, 30 (2001), pp. 432-450.
28. G. KORTSARZ AND Z. NUTOV, Approximating node connectivity problems via set covers, in Approximation Algorithms for Combinatorial Optimization, Lecture Notes in Comput. Sci. 1913, Springer-Verlag, Berlin, 2000, pp. 194-205.
29. G. KORTSARZ AND Z. NUTOV, Approximating k-node connected subgraphs via critical graphs, in Proceedings of the 36th ACM Symposium on Theory of Computing, 2004, to appear.
30. E. PETRANK, The hardness of approximation: Gap location, Comput. Complexity, 4 (1994), pp. 133-157.
31. R. RAVI AND D. P. WILLIAMSON, An approximation algorithm for minimum-cost vertex-connectivity problems, Algorithmica, 18 (1997), pp. 21-43.
32. R. RAVI AND D. P. WILLIAMSON, Erratum: An approximation algorithm for minimum-cost vertex-connectivity problems, in Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, ACM, New York, SIAM, Philadelphia, 2002, pp. 1000-1001.
33. R. RAZ, A parallel repetition theorem, SIAM J. Comput., 27 (1998), pp. 763-803.
34. V. V. VAZIRANI, Approximation Algorithms, Springer-Verlag, Berlin, 2001.
35. T. WATANABE AND A. NAKAMURA, A minimum 3-connectivity augmentation of a graph, J. Comput. System Sci., 46 (1993), pp. 91-128.