Affiliation:
1. Rutgers University Camden, Camden, NJ
2. The Open University of Israel, Raanana, Israel
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
,
ε
∪
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.
Publisher
Association for Computing Machinery (ACM)
Subject
Mathematics (miscellaneous)
Cited by
35 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献