Abstract
We consider the following problem: given a connected graph G = (V, ε E) and an additional edge set E, find a minimum size subset of edges F ⊆ E such that (V, ε ∪ F) is 2-edge connected. This problem is NP-hard. For a long time, 2 was the best approximation ratio known. Recently, Nagamochi reported a (1.875 + ε)-approximation algorithm. We give a new algorithm with a better approximation ratio of 3/2 and a practical running time.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
R. Bar-Yehuda, “One for the Price of Two: A Unified Approach for Approximating Covering Problems”, Algorithmica 27(2), 2000, 131–144.
J. Cheriyan, T. Jordán, and R. Ravi, “On 2-coverings and 2-packing of laminar families”, Lecture Notes in Computer Science, 1643, Springer Verlag, ESA’99, (1999), 510–520.
J. Cheriyan, A. Sebö, and Z. Szigeti, “An improved approximation algorithm for minimum size 2-edge connected spanning subgraphs”, Lecture Notes in Computer Science, 1412, Springer Verlag, IPCO’98, (1998), 126–136.
K. P. Eswaran and R. E. Tarjan, “Augmentation Problems”, SI AM J. Computing, 5 (1976), 653–665.
A. Frank, “Connectivity Augmentation Problems in Network Design”, Mathematical Programming, State of the Art, Ed. J. R. Birge and K. G. Murty, 1994, 34–63.
A. Frank, “Augmenting Graphs to Meet Edge-Connectivity Requirements”, SI AM Journal on Discrete Mathematics, 5 (1992), 25–53.
G. N. Frederickson and J. Jájá, “Approximation algorithms for several graph augmentation problems”, SI AM J. Computing, 10 (1981), 270–283.
M. X. Goemans and D. P. Williamson, “A General Approximation Technique for Constrained Forest Problems”, SI AM J. on Computing, 24, 1995, 296–317.
Kamal Jain, “Factor 2 Approximation Algorithm for the Generalized Steiner Network Problem”, FOCS 1998, 448–457.
H. Nagamochi, “An approximation for finding a smallest 2-edge connected subgraph containing a specified spanning tree”, TR #99019, (1999), Kyoto University, Kyoto, Japan. http://www.kuamp.kyoto-u.ac.jp/labs/or/members/naga/TC/99019.ps
H. Nagamochi and T. Ibaraki, “An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree”, Lecture Notes In Computer Science, vol. 1627, Springer-Verlag, 5th Annual International Computing and Combinatorics Conference, July 26–28, Tokyo, Japan, (1999) 31–40.
S. Khuller, Approximation algorithms for finding highly connected subgraphs, In Approximation algorithms for NP-hard problems, Ed. D. S. Hochbaum, PWS Publishing Boston, 1996.
S. Khuller and R. Thurimella, “Approximation algorithms for graph augmentation”, J. of Algorithms, 14 (1993), 214–225.
S. Vempala and A. Vetta, “On the minimum 2-edge connected subgraph”, Proc. of the 3rd Workshop on Approximation, Saarbrüucken, 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Even, G., Feldman, J., Kortsarz, G., Nutov, Z. (2001). 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. In: Goemans, M., Jansen, K., Rolim, J.D.P., Trevisan, L. (eds) Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques. RANDOM APPROX 2001 2001. Lecture Notes in Computer Science, vol 2129. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44666-4_13
Download citation
DOI: https://doi.org/10.1007/3-540-44666-4_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42470-3
Online ISBN: 978-3-540-44666-8
eBook Packages: Springer Book Archive