Better performance bounds for finding the smallest k-edge connected spanning subgraph of a multigraph

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2003, Pages 460-469

  Gabow, Harold N ^a  

^a UCB 450   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; ITERATIVE METHODS; PERFORMANCE; POLYNOMIALS; THEOREM PROVING;

APPROXIMATION RATIO; K-EDGE CONNECTED SPANNING SUBGRAPH; MULTIGRAPH;

ALGORITHMS;

EID: 0038754138     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. M. Cai, The number of vertices of degree k in a minimally k-edge-connected graph, J. Comb. Theory B,. 58 (1993), pp. 225-239.
2. J. Cheriyan and R. Thurimella, Approximating minimum-size k-connected spanning subgraphs via matching, SIAM J. Comput., 30, 2 (2000), pp. 528-560.
3. C. G. Fernandes, A better approximation ratio for the minimum size k-edge-connected spanning subgraph problem, J. Algorithms, 28, 1 (1998), pp. 105-124.
4. A. Frank, Submodular functions in graph theory, Discrete Math., 111 (1993), pp. 231-243.
5. H. N. Gabow, An ear decomposition approach to approximating the smallest 3-edge connected spanning subgroup of a multigraph, Proc. 13th Annual ACM-SIAM Symp. on Disc. Algorithms, (2002), pp. 84-93; complete version available at http://www.cs.colorado.edu/~hal.
6. ____, Better performance bounds for finding the smallest k-edge connected spanning subgraph of a multigraph, complete version available at http://www.cs.colorado.edu/~hal.
7. ____, On the difficulty of k-connected spanning subgraph problems, unpublished notes.
8. A. V. Goldberg and S. Rao, Beyond the flow decomposition barrier, J. ACM 45, 5 (1998), pp. 783-798.
9. R. Jothi, B. Raghavachari, and S. Varadarajan, A 5/4-approximation algorithm for minimum 2-edge-connectivity, these proceedings.
10. D. R. Karger, Random sampling in cut, flow, and network design problems, Math. of OR 24, 2 (1999), pp. 383-413.
11. S. Khuller, Approximation algorithms for finding highly connected subgraphs, in Approximation Algorithms for NP-hard Problems, D. S. Hochbaum, Ed., PWS Publishing, Boston, MA, pp. 236-265, 1997.
12. S. Khuller and B. Raghavachari, Improved approximation algorithms for uniform connectivity problems. J. Algorithms 21, 2 (1996), pp. 434-450.
13. S. Khuller and U. Vishkin, Biconnectivity approximations and graph carvings, J. ACM 41, 2 (1994), pp. 214-235.
14. V. King, S. Rao, and R. Tarjan, A faster deterministic maximum flow algorithm, J. Algorithms 17, 3 (1994), pp. 447-474.
15. H. Nagamochi and T. Ibaraki, Computing edge-connectivity in multigraphs and capacitated graphs, SIAM J. on Discrete Math., 5, 1 (1992), pp. 54-66.
16. R. E. Tarjan, Depth-first search and linear graph algorithms, SIAM J. Comput., 1, 2 (1972), pp. 146-160.
17. ____, Applications of path compression on balanced trees, J. ACM, 26, 4 (1979), pp. 690-715.