An ear decomposition approach to approximating the smallest 3-edge connected spanning subgraph of a multigraph

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 06-08-January-2002, Issue , 2002, Pages 84-93

  Gabow, Harold N ^a  

^a UCB 450   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; DIRECTED GRAPHS;

2-EDGE CONNECTED GRAPH; APPROXIMATION RATIOS; CONNECTED COMPONENT; EAR DECOMPOSITION; MULTIGRAPHS; RUNNING TIME; SUBGRAPHS;

ALGORITHMS;

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

References (11)

1. T.H. Gormen, C.E. Leiserson and R.L. Rivest, Introduction to Algorithms, McGraw-Hill, New York, 1990.
2. J. Cheriyan, A. Sebo and Z. Szigeti, Improving on the 1.5-approximation of a smallest 2-edge connected spanning subgraph, SIAM J. Disc. Math., 14, 2, pp.170-180, 2001.
3. J. Cheriyan and R. Thurimella, Approximating minimum-size k-connected spanning subgraphs via matching, SIAM J. Comput., 30, 2, pp.528-560, 2000.
4. C.G. Fernandes, A better approximation ratio for the minimum size k-edge-connected spanning subgraph problem, J. Algorithms, 28, 1, pp. 105-124, 1998.
5. H.N. Gabow, An ear decomposition approach to approximating the smallest 3-edge connected spanning subgraph of a multigraph, available at http://www.cs.colorado.edu/-hal.
6. N. Garg, V.S. Santosh and A. Singla, Improved approximation algorithms for biconnected subgraphs via better lower bounding techniques, Proc. 4th Annual ACM-SIAM Symp. on Disc. Algorithms, pp.103-111, 1993.
7. S. Khuller, Approximation algorithms for finding highly connected subgraphs, in Appoximation Algorithms for NP-hard Problems, D.S. Hochbaum, Ed., PWS Publishing, Boston, MA, 1997.
8. S. Khuller and B. Raghavachari, Improved approximation algorithms for uniform connectivity problems, J. Algorithms 21, 2, pp.434-450, 1996.
9. S. Khuller and U. Vishkin, Biconnectivity approximations and graph carvings, J. ACM 41, 2, pp.214-235, 1994.
10. S. Vempala and A. Vetta, Factor 4/3 approximations for minimum 2-connected subgraphs, in Appoximation Algorithms for Combinatorial Optimization, K. Jansen and S. Khuller, Eds., Springer-Verlag, Lecture Notes in Computer Science 1931, pp.262-273, 2000.
11. D.B. West, Introduction to Graph Theory, 2nd Ed., Prentice-Hall, 2001.