Approximating k-node connected subgraphs via critical graphs

SIAM Journal on Computing

Volumn 35, Issue 1, 2006, Pages 247-257

  Kortsarz, Guy ^a   Nutov, Zeev ^b  

^a RUTGERS UNIVERSITY   (United States)

^b OPEN UNIVERSITY OF ISRAEL   (Israel)

Author keywords

Approximation; Connectivity; Graphs; Network design

Indexed keywords

APPROXIMATION RATIO; CONNECTIVITY; NETWORK DESIGN;

ALGORITHMS; GRAPH THEORY; NUMBER THEORY; PROBLEM SOLVING;

APPROXIMATION THEORY;

EID: 33644585066     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539703435753     Document Type: Article

References (30)

1. 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.
2. J. CHERIYAN, T. JORDÁN, AND Z. NUTOV, On rooted node-connectivity problems, Algorithmica, 30 (2001), pp. 353-375.
3. J. CHERIYAN AND R. THURIMELLA, Approximating minimum-size k-connected spanning subgraphs via matching, SIAM J. Comput., 30 (2000), pp. 528-560.
4. J. CHERIYAN, S. VEMPALA, AND A. VETTA, An approximation algorithm for the minimum-cost k-vertex connected subgraph, SIAM J. Comput., 32 (2003), pp. 1050-1055.
5. A. FRANK, Connectivity augmentation problems in network design, in Mathematical Programming: State of the Art, J. R. Birge and K. G. Murty, eds., University of Michigan, Ann Arbor, 1994, pp. 34-63.
6. A. FRANK, Increasing the rooted connectivity of a digraph by one, Math. Programming, 84 (1999), pp. 565-576.
7. A. FRANK AND T. JORDÁN, Minimal edge-coverings of pairs of sets, J. Combin. Theory Ser. B, 65 (1995), pp. 73-110.
8. A. FRANK AND E. TARDOS, An application of submodular flows, Linear Algebra Appl., 114/115 (1989), pp. 329-348.
9. H. N. GABOW, A representation for crossing set families with application to submodular flow problems, in Proceedings of the 4th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), SIAM, Philadelphia, 1993, pp. 202-211.
10. L. GRAHAM, M. GRÖTSCHEL, AND L. LOVÁSZ, EDS., Handbook of Combinatorics, Vol. 1, Elsevier Science B.V., Amsterdam; MIT Press, Cambridge, MA, 1995.
11. T. JORDÁN, On the optimal vertex-connectivity augmentation, J. Combin. Theory Ser. B, 63 (1995), pp. 8-20.
12. T. JORDÁN, On the existence of (k,l)-critical graphs, Discrete Math., 179 (1998), pp. 273-275.
13. B. JACKSON AND T. JORDÁN, A near optimal algorithm for vertex connectivity augmentation, in Algorithms and Computations, Lecture Notes in Comput. Sci. 1969, Springer, Berlin, 2000, pp. 313-325.
14. K. JAIN, A factor 2 approximation algorithm for the generalized Steiner network problem, Combinatorica, 21 (2001), pp. 39-60.
15. G. KORTSARZ, R. KRAUTHGAMER, AND J. LEE, Hardness of approximation for vertex-connectivity network design problems, SIAM J. Comput., 33 (2004), pp. 704-720.
16. G. KORTSARZ AND Z. NUTOV, Approximating node connectivity problems via set covers, Algorithmica, 37 (2003), pp. 75-92.
17. S. KHULLER AND B. RAGHAVACHARI, Improved approximation algorithms for uniform connectivity problems, J. Algorithms, 21 (1996), pp. 434-450.
18. M. KRIESELL, Upper bounds to the number of vertices in a k-critically n-connected graph, Graphs Combin., 18 (2002), pp. 133-146.
19. W. MADER, Ecken vom Grad n in minimalen n-fach zusammenhängenden Graphen, Arch. Math. (Basel), 23 (1972), pp. 219-224.
20. W. MADER, Minimal n-fach zusammenhängende digraphen, J. Combin. Theory Ser. B, 38 (1985), pp. 102-117.
21. W. MADER, Endlichkeitsätze für k-kritische graphen, Math. Ann., 229 (1977), pp. 143-153.
22. W. MADER, On k-con-critically n-connected graphs, J. Combin. Theory Ser. B, 86 (2002), pp. 296-314.
23. W. MADER, High connectivity keeping sets in n-connected graphs, Combinatorica, 24 (2004), pp. 441-458.
24. W. MADER, Connectivity and edge-connectivity in finite graphs, in Surveys in Combinatorics, London Math. Soc. Lecture Notes Ser. 38, Cambridge University Press, Cambridge, UK, 1979, pp. 66-95.
25. W. MADER, On k-critically n-connected graphs, in Progress in Graph Theory, Academic Press, Toronto, ON, 1984, pp. 389-398.
26. B. MAURER AND P. SLATER, On k-critical, n-connected graphs, Discrete Math., 20 (1988), pp. 255-262.
27. Z. NUTOV, Approximating connectivity augmentation problems, in Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, Philadelphia, 2005, pp. 176-185.
28. R. RAVI AND D. P. WILLIAMSON, An approximation algorithm for minimum-cost vertex-connectivity problems, Algorithmica, 18 (1997), pp. 21-43.
29. R. RAVI AND D. P. WILLIAMSON, Erratum: An approximation algorithm for minimum-cost vertex-connectivity problems, Algorithmica, 34 (2002), pp. 98-107.
30. J. SU, Proof of Slater's conjecture on k-critical n-connected graphs, Kexue Tongbao (English Ed.), 33 (1988), pp. 1675-1678.