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

Authors:
Harold N. Gabow
Affiliations:
University of Colorado at Boulder, Boulder, Colorado
Venue:
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Year:
2002

Citing 8
Cited 3

Introduction to algorithms

Introduction to algorithms
Biconnectivity approximations and graph carvings

Journal of the ACM (JACM)
Improved approximation algorithms for uniform connectivity problems

Journal of Algorithms
Approximation algorithms for finding highly connected subgraphs

Approximation algorithms for NP-hard problems
A better approximation ratio for the minimum size k-edge-connected spanning subgraph problem

Journal of Algorithms
Improved approximation algorithms for biconnected subgraphs via better lower bounding techniques

SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Approximating Minimum-Size k-Connected Spanning Subgraphs via Matching

SIAM Journal on Computing
Improving on the 1.5-Approximation of a Smallest 2-Edge Connected Spanning Subgraph

SIAM Journal on Discrete Mathematics

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

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
A 5/4-approximation algorithm for minimum 2-edge-connectivity

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Approximation schemes for minimum 2-connected spanning subgraphs in weighted planar graphs

ESA'05 Proceedings of the 13th annual European conference on Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper gives a 3/2 approximation algorithm for the smallest 3-edge connected spanning subgraph of an undirected multigraph. The previous best algorithm of Khuller and Raghavachari [8] has approximation ratio 5/3. The algorithm of Cheriyan and Thurimella [3] achieves ratio 3/2 for simple graphs. Our approach is based on the relationship between an ear decomposition of a 2-edge connected graph and 3-edge connected components, enabling us to achieve running time O(mα(m,n)).