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

@article{Even2011A1A,
title={A 1.5-approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2},
author={Guy Even and Guy Kortsarz and Zeev Nutov},
journal={Inf. Process. Lett.},
year={2011},
volume={111},
pages={296-300}
}

We consider 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. In [4] we presented a 1.8 approximation for the problem. In this paper we improve the ratio to 1.5. ∗Preliminary version appeared in APPROX 2001, LNCS 2129, pp. 90-101, 2001. †Dept. of Electrical Engineering-Systems, Tel-Aviv University, Tel-Aviv 69978, Israel. E-mail:guy@eng.tau.ac.il. ‡Rutgers… CONTINUE READING