Improved Approximation for Tree Augmentation: Saving by Rewiring

04/06/2018
by   Fabrizio Grandoni, et al.
0

The Tree Augmentation Problem (TAP) is a fundamental network design problem in which we are given a tree and a set of additional edges, also called links. The task is to find a set of links, of minimum size, whose addition to the tree leads to a 2-edge-connected graph. A long line of results on TAP culminated in the previously best known approximation guarantee of 1.5 achieved by a combinatorial approach due to Kortsarz and Nutov [ACM Transactions on Algorithms 2016], and also by an SDP-based approach by Cheriyan and Gao [Algorithmica 2017]. Moreover, an elegant LP-based (1.5+ϵ)-approximation has also been found very recently by Fiorini, Groß, Könemann, and Sanitá [SODA 2018]. In this paper, we show that an approximation factor below 1.5 can be achieved, by presenting a 1.458-approximation that is based on several new techniques.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

11/30/2020

Bridging the Gap Between Tree and Connectivity Augmentation: Unified and Stronger Approaches

We consider the Connectivity Augmentation Problem (CAP), a classical pro...
04/14/2021

A Better-Than-2 Approximation for Weighted Tree Augmentation

We present an approximation algorithm for Weighted Tree Augmentation wit...
11/06/2019

Breaching the 2-Approximation Barrier for Connectivity Augmentation: a Reduction to Steiner Tree

The basic goal of survivable network design is to build a cheap network ...
12/22/2021

Breaching the 2-Approximation Barrier for the Forest Augmentation Problem

The basic goal of survivable network design is to build cheap networks t...
07/15/2021

Local Search for Weighted Tree Augmentation and Steiner Tree

We present a technique that allows for improving on some relative greedy...
04/26/2019

Tight Bounds for Online Weighted Tree Augmentation

The Weighted Tree Augmentation problem (WTAP) is a fundamental problem i...
11/18/2021

On the Recoverable Traveling Salesman Problem

In this paper we consider the Recoverable Traveling Salesman Problem (TS...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.