Factor 4/3 approximations for minimum 2-connected subgraphs

Authors:
Santosh Vempala;Adrian Vetta
Affiliations:
-;-
Venue:
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
Year:
2000

Citing 3
Cited 8

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
A New Bound for the 2-Edge Connected Subgraph Problem

Proceedings of the 6th International IPCO Conference on Integer Programming and Combinatorial Optimization

On the Hardness of Constructing Minimal 2-Connected Spanning Subgraphs in Complete Graphs with Sharpened Triangle Inequality

FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
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
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
Finding 2-edge connected spanning subgraphs

Operations Research Letters
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

We present factor 4/3 approximation algorithms for the problems of finding theminimum 2-edge connected and theminimum 2-vertex connected spanning subgraph of a given undirected graph.