Approximation algorithms for the minimum cardinality two-connected spanning subgraph problem

Authors:
Prabhakar Gubbala;Balaji Raghavachari
Affiliations:
Computer Science Department, University of Texas at Dallas, Richardson, TX;Computer Science Department, University of Texas at Dallas, Richardson, TX
Venue:
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
Year:
2005

Citing 13
Cited 1

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
Approximation algorithms for minimum-cost k-vertex connected subgraphs

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
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
The Square-Free 2-Factor Problem in Bipartite Graphs

Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
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
An Ear Decomposition Approach to Approximating the Smallest 3-Edge Connected Spanning Subgraph of a Multigraph

SIAM Journal on Discrete Mathematics

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

The minimum cardinality 2-connected spanning subgraph problem is considered. An approximation algorithm with a performance ratio of 9/7 ≈ 1.286 is presented. This improves the previous best ratio of 4/3 for the problem. An approximation algorithm with a performance ratio of 5/4 in graphs with a minimum-degree of three at every node is also presented. This class includes all 3-connected graphs.