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

Authors:
Guy Even;Guy Kortsarz;Zeev Nutov
Affiliations:
Tel-Aviv University, Israel;Rutgers University, Camden, United States;The Open University of Israel, Israel
Venue:
Information Processing Letters
Year:
2011

Citing 3
Cited 1

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 3/2-Approximation Algorithm for Augmenting the Edge-Connectivity of a Graph from 1 to 2 Using a Subset of a Given Edge Set

APPROX '01/RANDOM '01 Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization
A 1.8 approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2

ACM Transactions on Algorithms (TALG)

A (1 + ln 2)-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius

APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques

Quantified Score

Hi-index	0.89

Visualization

Abstract

We consider the following NP-hard problem: given a connected graph G=(V,E) and a link 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. In G. Even et al. (2005) [2] we presented a 1.8-approximation for the problem. In this paper we improve the ratio to 1.5.