Approximating node connectivity problems via set covers

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1913, Issue , 2000, Pages 194-205

  Kortsarz, Guy ^a   Nutov, Zeev ^a  

^a OPEN UNIVERSITY OF ISRAEL   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; GRAPH THEORY;

APPROXIMATION RATIOS; BEST-KNOWN ALGORITHMS; CONNECTED GRAPH; INTERNALLY-DISJOINT PATHS; METRIC COST; MINIMUM COST; NODE CONNECTIVITY; SPANNING SUBGRAPHS;

APPROXIMATION ALGORITHMS;

EID: 84937389799     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44436-x_20     Document Type: Conference Paper

References (16)

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”, to appear in Algorithmica special issue on APPROX’98.
4. D. Coppersmith and S. Winograd: Matrix multiplication via arithmetic progressions, J. Symbolic Comp., 9 (1990), 251–280.
5. 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.
6. 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.
7. A. Frank and E. 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 1993, 202–211.
9. T. Jordàn, “On the optimal vertex-connectivity augmentation”, J. Comb. Theory B 63, 1995, 8–20.
10. S. Khuller, Approximation algorithms for finding highly connected subgraphs, In Approximation algorithms for NP-hard problems, Ed. D. S. Hochbaum, PWS publishing co., Boston, 1996.
11. S. Khuller and B. Raghavachari, Improved approximation algorithms for uniform connectivity problems, J. of Algorithms 21, 1996, 434–450.
12. J. B. Orlin, “A faster strongly polynomial minimum cost flow algorithm”, Operations Research 41, 1993, 338–350.
13. R. Ravi and D. P. Williamson, An approximation algorithm for minimum-cost vertex-connectivity problems, Algorithmica 18, (1997), 21–43.
14. R. Ravi and D. P. Williamson, private communication.
15. W. Mader, “Ecken vom Grad n in minimalen n-fach zusammenh¨angenden Graphen”, Archive der Mathematik 23, 1972, 219–224.
16. W. Mader, “Degree and local connectivity in finite graphs”, Recent advances in graph theory (Proc. Second Czechoslovak Sympos., Prague, 1974), Academia, Prague (1975), 341–344.