Finding 2-edge connected spanning subgraphs

Authors:
Woonghee Tim Huh
Affiliations:
Industrial Engineering and Operations Research Department, Columbia University, New York, NY 10027, USA
Venue:
Operations Research Letters
Year:
2004

Citing 4
Cited 0

Biconnectivity approximations and graph carvings

Journal of the ACM (JACM)
Improved approximation algorithms for biconnected subgraphs via better lower bounding techniques

SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Approximation Algorithms for Minimum Size 2-Connectivity Problems

STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Factor 4/3 approximations for minimum 2-connected subgraphs

APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper studies the NP-hard problem of finding a minimum size 2-edge connected spanning subgraph (2-ECSS). An algorithm is given that on an r-edge connected input graph G=(V,E) finds a 2-ECSS of size at most |V|+(|E|-|V|)/(r-1). For r-regular, r-edge connected input graphs for r=3, 4, 5 and 6, this gives approximation guarantees of 54,43,118 and 75, respectively.