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

Guy Kortsarz; Zeev Nutov

doi:10.1145/2786981

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

Guy Kortsarz, Zeev Nutov

Computer Science discipline

Research output: Contribution to journal › Article › peer-review

Abstract

The Tree Augmentation Problem (TAP) is as follows: given a connected graph G = (V, ε) and an edge set E on V, find a minimum size subset of edges F ⊆ E such that (V, ε cup F) is 2-edge-connected. In the conference version [Even et al. 2001] was sketched a 1.5-approximation algorithm for the problem. Since a full proof was very complex and long, the journal version was cut into two parts. The first part [Even et al. 2009] only proved ratio 1.8. An attempt to simplify the second part produced an error in Even et al. [2011]. Here we give a correct, different, and self-contained proof of the ratio 1.5 that is also substantially simpler and shorter than the previous proofs.

Original language	English
Article number	23
Journal	ACM Transactions on Algorithms
Volume	12
Issue number	2
DOIs	https://doi.org/10.1145/2786981
State	Published - Nov 2015

Bibliographical note

Publisher Copyright:
© 2015 ACM 1549-6325/2015/11-ART23 $15.00.

Keywords

Edge connectivity
Laminar set family
Tree Augmentation

Access to Document

10.1145/2786981

Cite this

@article{b1f4f9d68a9642f49f0391c89e8431e1,

title = "A simplified 1.5-approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2",

abstract = "The Tree Augmentation Problem (TAP) is as follows: given a connected graph G = (V, ε) and an edge set E on V, find a minimum size subset of edges F ⊆ E such that (V, ε cup F) is 2-edge-connected. In the conference version [Even et al. 2001] was sketched a 1.5-approximation algorithm for the problem. Since a full proof was very complex and long, the journal version was cut into two parts. The first part [Even et al. 2009] only proved ratio 1.8. An attempt to simplify the second part produced an error in Even et al. [2011]. Here we give a correct, different, and self-contained proof of the ratio 1.5 that is also substantially simpler and shorter than the previous proofs.",

keywords = "Edge connectivity, Laminar set family, Tree Augmentation",

author = "Guy Kortsarz and Zeev Nutov",

note = "Publisher Copyright: {\textcopyright} 2015 ACM 1549-6325/2015/11-ART23 $15.00.",

year = "2015",

month = nov,

doi = "10.1145/2786981",

language = "אנגלית",

volume = "12",

journal = "ACM Transactions on Algorithms",

issn = "1549-6325",

publisher = "Association for Computing Machinery (ACM)",

number = "2",

}

TY - JOUR

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

AU - Kortsarz, Guy

AU - Nutov, Zeev

PY - 2015/11

Y1 - 2015/11

N2 - The Tree Augmentation Problem (TAP) is as follows: given a connected graph G = (V, ε) and an edge set E on V, find a minimum size subset of edges F ⊆ E such that (V, ε cup F) is 2-edge-connected. In the conference version [Even et al. 2001] was sketched a 1.5-approximation algorithm for the problem. Since a full proof was very complex and long, the journal version was cut into two parts. The first part [Even et al. 2009] only proved ratio 1.8. An attempt to simplify the second part produced an error in Even et al. [2011]. Here we give a correct, different, and self-contained proof of the ratio 1.5 that is also substantially simpler and shorter than the previous proofs.

AB - The Tree Augmentation Problem (TAP) is as follows: given a connected graph G = (V, ε) and an edge set E on V, find a minimum size subset of edges F ⊆ E such that (V, ε cup F) is 2-edge-connected. In the conference version [Even et al. 2001] was sketched a 1.5-approximation algorithm for the problem. Since a full proof was very complex and long, the journal version was cut into two parts. The first part [Even et al. 2009] only proved ratio 1.8. An attempt to simplify the second part produced an error in Even et al. [2011]. Here we give a correct, different, and self-contained proof of the ratio 1.5 that is also substantially simpler and shorter than the previous proofs.

KW - Edge connectivity

KW - Laminar set family

KW - Tree Augmentation

UR - http://www.scopus.com/inward/record.url?scp=84947911898&partnerID=8YFLogxK

U2 - 10.1145/2786981

DO - 10.1145/2786981

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:84947911898

SN - 1549-6325

VL - 12

JO - ACM Transactions on Algorithms

JF - ACM Transactions on Algorithms

IS - 2

M1 - 23

ER -

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

Abstract

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this