Approximating node connectivity problems via set covers

Algorithmica (New York)

Volumn 37, Issue 2, 2003, Pages 75-92

  Kortsarz, Guy ^a   Nutov, Zeev ^b  

^a RUTGERS UNIVERSITY   (United States)

^b OPEN UNIVERSITY OF ISRAEL   (Israel)

Author keywords

Approximation algorithms; k Vertex connected spanning subgraph; Metric costs

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; POLYNOMIALS; PROBLEM SOLVING; SET THEORY; THEOREM PROVING;

APPROXIMATING NODE CONNECTIVITY PROBLEMS; APPROXIMATION ALGORITHMS; METRIC COSTS; SET COVERS;

APPROXIMATION THEORY;

EID: 0942290222     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-003-1027-4     Document Type: Article

References (22)

1. R. P. Anstee, A polynomial time algorithm for b-matchings: an alternative approach, Information Processing Letters 24 (1987), 153-157.
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 (1999), 21-30.
3. J. Cheriyan, T. Jordán, and Z. Nutov, On rooted node-connectivity problems, Algorithmica 30 (specal issue on APPROX '98), (2000), 353-375.
4. J. Cheriyan, S. Vempala, and A. Vetta, An approximation algorithm for the minimum cost k-vertex connected subgraph, Manuscript, July 2001.
5. J. Cheriyan, S. Vempala, and A. Vetta, Network design via iterative rounding of setpair relaxations, Manuscript, October 2001.
6. D. Coppersmith and S. Winograd, Matrix multiplication via arithmetic progressions, Journal of Symbolic Computation 9 (1990), 251-280.
7. Y. Dinitz and Z. Nutov, A 3-approximation algorithm for finding optimum 4,5-vertex-connected spanning subgraphs, Journal of Algorithms 32 (1999), 31-40.
8. 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 Press, Ann Arbor, MI, 1994, pp. 34-63.
9. A. Frank and É. Tardos, An application of submodular flows, Linear Algebra and its Applications 114/115 (1989), 329-348.
10. G. N. Frederickson and J. Jájá, On the relationship between the biconnectivity augmentation and traveling salesman problems, Theoretical Computer Science 19(2) (1982), 189-201.
11. H. N. Gabow, A representation for crossing set families with application to submodular flow problems, Proceedings of the 4th Annual ACM-SIAM Symposium on Discrete Algorithms, 1993, pp. 202-211.
12. K. Jain, A factor 2 approximation algorithm for the generalized Steiner network problem, Combinatorica 21(1) (2001), 39-60.
13. T. Jordán, On the optimal vertex-connectivity augmentation, Journal of Combinatorial Theory, Series B 63 (1995), 8-20.
14. S. Khuller, Approximation algorithms for finding highly connected subgraphs, in Approximation Algorithms for NP-Hard Problems, D. S. Hochbaum, ed., PWS, Boston, MA, 1996, pp. 236-265.
15. S. Khuller and B. Raghavachari, Improved approximation algorithms for uniform connectivity problems, Journal of Algorithms 21 (1996), 434-450.
16. G. Kortsarz and Z. Nutov, Improved approximation algorithm for k-node connected subgraphs via critical graphs, Manuscript, February 2003.
17. W. Mader, Ecken vom Grad n in minimalen n-fach zusammenhängenden Graphen, Archive der Mathematik 23 (1972), 219-224.
18. W. Mader, Degree and local connectivity in finite graphs, Recent Advances in Graph Theory (Proceedings of the Second Czechoslovak Symposium, Prague, 1974), Academia, Prague, 1975, pp. 341-344.
19. W. Mader, Minimal n-fach in minimalen n-fach zusammenhängenden Digraphen, Journal of Combinatorial Theory, Series B, 38 (1985), 102-117.
20. J. B. Orlin, A faster strongly polynomial minimum cost flow algorithm, Operations Research 41 (1993), 338-350.
21. R. Ravi and D. P. Williamson, An approximation algorithm for minimum-cost vertex-connectivity problems, Algorithmica 18 (1997), 21-43.
22. R. Ravi and D. P. Williamson, Erratum: an approximation algorithm for minimum-cost vertex-connectivity problems, Manuscript, July 2001.