A 5/4-approximation algorithm for minimum 2-edge-connectivity

Authors:
Raja Jothi;Balaji Raghavachari;Subramanian Varadarajan
Affiliations:
The University of Texas at Dallas, Richardson, TX;The University of Texas at Dallas, Richardson, TX;The University of Texas at Dallas, Richardson, TX
Venue:
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Year:
2003

Citing 11
Cited 16

Biconnectivity approximations and graph carvings

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

Journal of Algorithms
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
On approximability of the minimum-cost k-connected spanning subgraph problem

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for minimum-cost k-vertex connected subgraphs

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
An ear decomposition approach to approximating the smallest 3-edge connected spanning subgraph of a multigraph

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
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

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
Approximation schemes for minimum 2-edge-connected and biconnected subgraphs in planar graphs

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Iterated rounding algorithms for the smallest k-edge connected spanning subgraph

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
A global approach for designing reliable WDM networks and grooming the traffic

Computers and Operations Research
A 1.8 approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2

ACM Transactions on Algorithms (TALG)
Distributed approximation algorithms for finding 2-edge-connected subgraphs

OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Min-power strong connectivity

APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Bounded length, 2-edge augmentation of geometric planar graphs

COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I
On the maximum size of a minimal k-edge connected augmentation

Journal of Combinatorial Theory Series B
Approximation schemes for minimum 2-connected spanning subgraphs in weighted planar graphs

ESA'05 Proceedings of the 13th annual European conference on 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
A 5/4-approximation algorithm for biconnecting a graph with a given hamiltonian path

WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
Approximating the edge length of 2-edge connected planar geometric graphs on a set of points

LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Iterated Rounding Algorithms for the Smallest k-Edge Connected Spanning Subgraph

SIAM Journal on Computing
Minimum weight 2-edge-connected spanning subgraphs in planar graphs

ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
A 4/3-approximation algorithm for minimum 3-edge-connectivity

WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures

Quantified Score

Hi-index	0.00

Visualization

Abstract

A 5/4-approximation algorithm is presented for the minimum cardinality 2-edge-connected spanning subgraph problem in undirected graphs. This improves the previous best approximation ratio of 4/3. It is shown that our ratio is tight with respect to current lower bounds, and any further improvement is possible only if new lower bounds are discovered.