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

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-8 of 8 references

Covering a laminar family by leaf to leaf links

Discrete Applied Mathematics • 2010
View 1 Excerpt

A 3/2-approximation for augmenting a connected graph into a two-connected graph. APPROX

G. Even, J. Feldman, G. Kortsarz, Z. Nutov
2001
View 1 Excerpt

Approximation algorithms for finding highly connected subgraphs ( chapter 6 )

S. Khuller, R. Thurimella
Approximation algorithms for NP - hard problems • 1996

On the relationship between the biconnectivity augmentation and traveling salesman problem

A. Goldberg M. Goemans, S. Plotkin, E. T. D. Shmoys, D. Williamson
Theoretical Computer Science • 1982

A 3 / 2 - approximation for augmenting a connected graph into a two - connected graph Approximation algorithms for several graph augmentation problems

J. Feldman G. Even, G. Kortsarz
SIAM J . Computing • 1976

Similar Papers

Loading similar papers…