Approximation algorithm for k-node connected subgraphs via critical graphs

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2004, Pages 138-145

  Kortsarz, G ^a   Nutov, Z ^b  

^a RUTGERS UNIVERSITY   (United States)

^b OPEN UNIVERSITY OF ISRAEL   (Israel)

Author keywords

Algorithms

Indexed keywords

APPROXIMATION THEORY; COST ACCOUNTING; GRAPH THEORY; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING;

APPROXIMATION ALGORITHM; COST EDGE; CRITICAL GRAPHS; SUBGRAPHS;

ALGORITHMS;

EID: 4544293736     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1007352.1007381     Document Type: Conference Paper

References (26)

1. 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, 1999, 21-30.
2. J. Cheriyan, T. Jordán, and Z. Nutov, On rooted node-connectivity problems, Algorithmica 30 (special issue on APPROX'98), 2001, 353-375.
3. J. Cheriyan and R. Thurimella, Approximating minimum-size k-connected spanning subgraphs via matching, SIAM J. Comput. 30, no. 2, 2000, 528-560.
4. J. Cheriyan, S. Vempala, and A. Vetta, Approximation algorithms for minimum-cost k-vertex connected subgraphs, in Proc. 34th ACM Symp. on Theory of Computing (STOC 2002), 306-312.
5. A. Frank, Connectivity augmentation problems in network design, Mathematical Programming, State of the Art, J. R. Birge and K. G. Murty eds., 1994, 34-63.
6. A. Frank and T. Jordán, Minimal edge-coverings of pairs of sets, J. Comb. Theory B 65, 1995, 73-110.
7. A. Frank and É. Tardos, An application of submodular flows, Linear Algebra and its Applications 114/115, 1989, 329-348.
8. H. N. Gabow, A representation for crossing set families with application to submodular flow problems, Proc. 4th Annual ACM-SIAM Symp. on Discrete Algorithms (SODA 1993), 202-211.
9. Handbook of Combinatorics, Vol. 1 Ch. 7, L. Graham, M. Grötschel, and L.Lovász Eds., 1995.
10. T. Jordán, On the optimal vertex-connectivity augmentation, J. Combinatorial Theory Series B 63, 1995, 8-20.
11. T. Jordán, On the existence of (k, ℓ-critical graphs, Discrete Math. 179, 1-3, 1998, 273-275.
12. B. Jackson and T. Jordán, A near optimal algorithm for vertex connectivity augmentation, in Proc. ISAAC 2000, LNCS 1969 (2000), 212-325.
13. G. Kortsarz and Z. Nutov, Approximating node connectivity problems via set covers, Algorithmica 37, 2003, 75-92.
14. S. Khuller and B. Raghavachari, Improved approximation algorithms for uniform connectivity problems, J. of Algorithms 21, 1996, 434-450.
15. M. Kriesell, Upper bounds to the number of vertices in a k-critically n-connected graph, Graphs and Combinatorics 18, 2002, no. 1, 133-146.
16. W. Mader, Ecken vom Grad n in minimalen n-fach zusammenhängenden Graphen, Archive der Mathematik 23, 1972, 219-224.
17. W. Mader, Minimal n-fach in minimalen n-fach zusammenhängenden Digraphen, J. Combinatorial Theory Series B, 38, 1985, 102-117.
18. W. Mader, Endlichkeitsätze für k-kritische Graphen (German), Math. Ann. 229, 1977, 143-153.
19. W. Mader, On k-con-critically n-connected graphs, J. Combin. Theory Ser. B 86, 2002, no. 2, 296-314.
20. W. Mader, High connectivity keeping sets in n-connected graphs, to appear in Combinatorica.
21. W. Mader, Connectivity and edge-connectivity in finite graphs, Surveys in Combinatorics (Proc. Seventh British Combinatorial Conf., Cambridge, 1979), 66-95, London Math. Soc. Lecture Notes Ser., 38, Cambridge Univ. Press, 1979.
22. W. Mader, On k-critically n-connected graphs, Progress in Graph Theory (Waterloo, Ont., 1982), 389-398, Academic Press, Toronto, On, 1984.
23. B. Maurer and P. Slater, On k-critical, n-connected graphs, Discrete Mathematics 20, 1988, 255-262.
24. R. Ravi and D. P. Williamson, An approximation algorithm for minimum-cost vertex-connectivity problems, Algorithmica 18, 1997, 21-43.
25. R. Ravi and D. P. Williamson, Erratum: An approximation algorithm for minimum-cost vertex-connectivity problems, Algorithmica 34(1), 2002, 98-107.
26. J. Su, Proof of Slater's conjecture on k-critical n-connected graphs, Kexue Tongbao (English Ed.) 33, 1988, no. 20, 1675-1678.