TY - GEN
T1 - 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 (Extended abstract)
AU - Even, Guy
AU - Feldman, Jon
AU - Kortsarz, Guy
AU - Nutov, Zeev
N1 - Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2001
Copyright:
Copyright 2015 Elsevier B.V., All rights reserved.
PY - 2015
Y1 - 2015
N2 - 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 suchth at (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.
AB - 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 suchth at (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.
UR - http://www.scopus.com/inward/record.url?scp=84923116061&partnerID=8YFLogxK
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:84923116061
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 90
EP - 101
BT - Approximation, Randomization, and Combinatorial Optimization
A2 - Trevisan, Luca
A2 - Jansen, Klaus
A2 - Goemans, Michel
A2 - Rolim, Jose D. P.
PB - Springer Verlag
T2 - 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2001 and 5th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2001
Y2 - 18 August 2001 through 20 August 2001
ER -