On the Tree Augmentation Problem

Nutov, Zeev

doi:10.48550/arxiv.1703.07247

Cited by 1 publication

(1 citation statement)

References 25 publications

(101 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…al [9] generalized the constraints from [16] and combined them with the bundle constraints from [1] to propose the ODD-LP we described above and achieved a 3 2 + ǫ approximation for the same special case (when all the costs are between 1 and some constant M ). Another recent paper by Nutov takes a subset of Adjiashvili's constraints and achieves a 12 7 + ǫ approximation when all the costs are between 1 and some constant M [19]. All of these techniques rely heavily on the bundle constraints that are focused on link weights being in a bounded range; hence they do not seem to be generalizable to the case of arbitrary weights.…”

Section: Related Workmentioning

confidence: 99%

Coloring Down: $3/2$-approximation for special cases of the weighted tree augmentation problem

Iglesias¹,

Ravi²

2017

Preprint

View full text Add to dashboard Cite

In this paper, we investigate the weighted tree augmentation problem (TAP), where the goal is to augment a tree with a minimum cost set of edges such that the graph becomes two edge connected. First we show that in weighted TAP, we can restrict our attention to trees which are binary and where all the non-tree edges go between two leaves of the tree. We then give two different top-down coloring algorithms. Both of our algorithms differ from known techniques for obtaining a 3 2 -approximation in unweighted TAP and current attempts to reach a 3 2 -approximation for weighted TAP.The first algorithm we describe always gives a 2-approximation starting from any feasible fractional solution to the natural tree cut covering LP. When the structure of the fractional solution is such that all the edges with non-zero weight are at least α, then this algorithm achieves a 2 1+α -approximation. We propose a new conjecture on extreme points of LP relaxations for the problem, which if true, will lead to a potentially constructive proof of an integrality gap of at most 3 2 for weighted TAP. In the second algorithm, we introduce simple extra valid constraints to the tree edge covering LP. In this algorithm, we focus on deficient edges, edges which get covered to an extent less than 4 3 in the fractional solution. We show that in the support of extreme points for this LP, deficient edges occurs in node-disjoint paths in the tree. When the number of such paths is at most two, we give a top-down coloring algorithm which decomposes 3 2 times the fractional solution into a convex combination of integer solutions. We believe our algorithms will be useful in eventually resolving the integrality gap of linear programming formulations for TAP.We also investigate a variant of TAP where each edge in the solution must be covered by a cycle of length three (triangle). We give a Θ(log n)-approximation algorithm for this problem in the weighted case and a 4-approximation in the unweighted case.

show abstract