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

Authors:
Guy Even;Jon Feldman;Guy Kortsarz;Zeev Nutov
Affiliations:
Tel-Aviv University, Tel-Aviv, Israel;Google, NY;Rutgers University, Camden, NJ;The Open University of Israel, Raanana, Israel
Venue:
ACM Transactions on Algorithms (TALG)
Year:
2009

Citing 6
Cited 3

Approximation algorithms for graph augmentation

Journal of Algorithms
A General Approximation Technique for Constrained Forest Problems

SIAM Journal on Computing
Approximation algorithms for finding highly connected subgraphs

Approximation algorithms for NP-hard problems
An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree

Discrete Applied Mathematics - Special issue: Special issue devoted to the fifth annual international computing and combinatories conference (COCOON'99) Tokyo, Japan 26-28 July 1999
A 5/4-approximation algorithm for minimum 2-edge-connectivity

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
On 2-Coverings and 2-Packings of Laminar Families

ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms

Covering a laminar family by leaf to leaf links

Discrete Applied Mathematics
A 1.5-approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2

Information Processing Letters
k-edge-connectivity: approximation and LP relaxation

WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a 1.8-approximation algorithm for the following NP-hard problem: Given a connected graph G = (V, E) and an edge set E on V disjoint to E, find a minimum-size subset of edges F ⊆ E such that (V, E ∪ F) is 2-edge-connected. Our result improves and significantly simplifies the approximation algorithm with ratio 1.875 + ϵ of Nagamochi.