A 4/3-approximation algorithm for minimum 3-edge-connectivity

Authors:
Prabhakar Gubbala;Balaji Raghavachari
Affiliations:
Microsoft Corporation, Redmond, WA;Computer Science Department, University of Texas at Dallas, Richardson, TX
Venue:
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Year:
2007

Citing 8
Cited 0

Biconnectivity approximations and graph carvings

Journal of the ACM (JACM)
Approximation algorithms for finding highly connected subgraphs

Approximation algorithms for NP-hard problems
Approximating Minimum-Size k-Connected Spanning Subgraphs via Matching

SIAM Journal on Computing
A 5/4-approximation algorithm for minimum 2-edge-connectivity

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Factor 4/3 approximations for minimum 2-connected subgraphs

APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
An Ear Decomposition Approach to Approximating the Smallest 3-Edge Connected Spanning Subgraph of a Multigraph

SIAM Journal on Discrete Mathematics
Approximating the smallest k-edge connected spanning subgraph by LP-rounding

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for the minimum cardinality two-connected spanning subgraph problem

IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

The minimum cardinality 3-edge-connected spanning subgraph problem is considered. An approximation algorithm with a performance ratio of 4/3 ≈ 1.33 is presented. This improves the previous best ratio of 3/2 for the problem. The algorithm also works on multigraphs and guarantees the same approximation ratio.