TY - JOUR
T1 - A 1.8 approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2
AU - Even, Guy
AU - Feldman, Jon
AU - Kortsarz, Guy
AU - Nutov, Zeev
PY - 2009/3/1
Y1 - 2009/3/1
N2 - We present a 1.8-approximation algorithm for 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. Our result improves and significantly simplifies the approximation algorithm with ratio 1.875 + ε of Nagamochi.
AB - We present a 1.8-approximation algorithm for 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. Our result improves and significantly simplifies the approximation algorithm with ratio 1.875 + ε of Nagamochi.
KW - Approximation algorithms
KW - Connectivity
KW - Graphs
UR - http://www.scopus.com/inward/record.url?scp=67149143139&partnerID=8YFLogxK
U2 - 10.1145/1497290.1497297
DO - 10.1145/1497290.1497297
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:67149143139
SN - 1549-6325
VL - 5
JO - ACM Transactions on Algorithms
JF - ACM Transactions on Algorithms
IS - 2
M1 - 21
ER -