An improved analysis for approximating the smallest κ-edge connected spanning subgraph of a multigraph

SIAM Journal on Discrete Mathematics

Volumn 19, Issue 1, 2005, Pages 1-18

  Gabow, Harold N ^a  

^a University of Colorado   (United States)

Author keywords

Approximation algorithms; Edge connectivity; Graph connectivity; Laminar family; Multigraphs; Network design

Indexed keywords

EDGE CONNECTIVITY; GRAPH CONNECTIVITY; LAMINAR FAMILY; MULTIGRAPHS; NETWORK DESIGN;

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; PROBLEM SOLVING;

GRAPH THEORY;

EID: 33644602025     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480102414910     Document Type: Article

References (22)

1. M. CAI, The number of vertices of degree k in a minimally k-edge-connected graph, J. Combin. Theory Ser. B, 58 (1993), pp. 225-239.
2. J. CHERIYAN, A. SEBÖ, AND Z. SZIGETI, Improving on the 1.5-approximation of a smallest 2-edge connected spanning subgraph, SIAM J. Discrete Math., 14 (2001), pp. 170-180.
3. J. CHERIYAN AND R. THURIMELLA, Approximating minimum-size k-connected spanning subgraphs via matching, SIAM J. Comput., 30 (2000), pp. 528-560.
4. C. G. FERNANDES, A better approximation ratio for the minimum size k-edge-connected spanning subgraph problem, J. Algorithms, 28 (1998), pp. 105-124.
5. A. FRANK, Submodular functions in graph theory, Discrete Math., 111 (1993), pp. 231-243.
6. H. N. GABOW, An ear decomposition approach to approximating the smallest 3-edge connected spanning subgraph of a multigraph, SIAM J. Discrete Math., 18 (2004), pp. 41-70.
7. H. N. GABOW, On the Difficulty of k-Connected Spanning Subgraph Problems, unpublished notes.
8. H. N. GABOW, M. X. GOEMANS, É. TARDOS, AND D. P. WILLIAMSON, Approximating the smallest k-edge connected spanning subgraph by LP-rounding, in Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, Philadelphia, 2005, pp. 562-571.
9. A. V. GOLDBERG AND S. RAO, Beyond the flow decomposition barrier, J. Assoc. Comput. Mach., 45 (1998), pp. 783-797.
10. M. X. GOEMANS, É. TARDOS, AND D. P. WILLIAMSON, private communication, 1994, cited in D. R. Karger, Random Sampling in Graph Optimization Problems, Ph.D. dissertation, Department of Computer Science, Stanford University, Stanford, CA, 1995, p. 205.
11. R. JOTHI, B. RAGHAVACHARI, AND S. VARADARAJAN, A 5/4-approximation algorithm for minimum 2-edge-connectivity, in Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, Philadelphia, 2003, pp. 725-734.
12. D. R. KARGER, Random sampling in cut, flow, and network design problems, Math. Oper. Res., 24 (1999), pp. 383-413.
13. S. KHULLER, Approximation algorithms for finding highly connected subgraphs, in Approximation Algorithms for NP-hard Problems, D. S. Hochbaum, ed., PWS Publishing, Boston, 1997, pp. 236-265.
14. S. KHULLER AND B. RAGHAVACHARI, Improved approximation algorithms for uniform connectivity problems, J. Algorithms, 21 (1996), pp. 434-450.
15. S. KHULLER AND U. VISHKIN, Biconnectivity approximations and graph carvings, J. Assoc. Comput. Mach., 41 (1994), pp. 214-235.
16. V. KING, S. RAO, AND R. TARJAN, A faster deterministic maximum flow algorithm, J. Algorithms, 17 (1994), pp. 447-474.
17. P. KRYSTA AND V. S. ANIL KUMAR, Approximation algorithms for minimum size 2-connectivity problems, in Proceedings of the 18th International Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Comput. Sci. 2010, Springer-Verlag, Berlin, 2001, pp. 431-442.
18. H. NAGAMOCHI AND T. IBARAKI, Computing edge-connectivity in multigraphs and capacitated graphs, SIAM J. Discrete Math., 5 (1992), pp. 54-66.
19. R. E. TARJAN, Depth-first search and linear graph algorithms, SIAM J. Comput., 1 (1972), pp. 146-160.
20. R. E. TARJAN, Applications of path compression on balanced trees, J. Assoc. Comput. Mach., 26 (1979), pp. 690-715.
21. V. V. VAZIRANI, Approximation Algorithms, Springer-Verlag, Berlin, 2001.
22. S. VEMPALA AND A. VETTA, Factor 4/3 approximations for minimum 2-connected subgraphs, in Approximation Algorithms for Combinatorial Optimization, K. Jansen and S. Khuller, eds., Lecture Notes in Comput. Sci. 1913, Springer-Verlag, Berlin, 2000, pp. 262-273.