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

by   Jaroslaw Byrka, et al.

The basic goal of survivable network design is to build a cheap network that maintains the connectivity between given sets of nodes despite the failure of a few edges/nodes. The Connectivity Augmentation Problem (CAP) is arguably one of the most basic problems in this area: given a k(edge)-connected graph G and a set of extra edges (links), select a minimum cardinality subset A of links such that adding A to G increases its edge connectivity to k + 1. Intuitively, one wants to make an existing network more reliable by augmenting it with extra edges. The best known approximation factor for this NP-hard problem is 2, and this can be achieved with multiple approaches (the first such result is in [Frederickson and Jaja'81]). It is known [Dinitz et al.'76] that CAP can be reduced to the case k = 1, a.k.a. the Tree Augmentation Problem (TAP), for odd k, and to the case k = 2, a.k.a. the Cactus Augmentation Problem (CacAP), for even k. Several better than 2 approximation algorithms are known for TAP, culminating with a recent 1.458 approximation [Grandoni et al.'18]. However, for CacAP the best known approximation is 2. In this paper we breach the 2 approximation barrier for CacAP, hence for CAP, by presenting a polynomial-time 2 ln(4) - 967 + ϵ < 1.91 approximation. Previous approaches exploit properties of TAP that do not seem to generalize to CacAP. We instead use a reduction to the Steiner tree problem which was previously used in parameterized algorithms [Basavaraju et al.'14]. This reduction is not approximation preserving, and using the current best approximation factor for Steiner tree [Byrka et al.'13] as a black-box would not be good enough to improve on 2. To achieve the latter goal, we "open the box" and exploit the specific properties of the instances of Steiner tree arising from CacAP.



There are no comments yet.


page 1

page 2

page 3

page 4


Breaching the 2-Approximation Barrier for the Forest Augmentation Problem

The basic goal of survivable network design is to build cheap networks t...

Improved Approximation for Tree Augmentation: Saving by Rewiring

The Tree Augmentation Problem (TAP) is a fundamental network design prob...

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

We consider the Connectivity Augmentation Problem (CAP), a classical pro...

Approximation Algorithms for Vertex-Connectivity Augmentation on the Cycle

Given a k-vertex-connected graph G and a set S of extra edges (links), t...

Node Connectivity Augmentation via Iterative Randomized Rounding

Many network design problems deal with the design of low-cost networks t...

Weighted Completion Time Minimization for Unrelated Machines via Iterative Fair Contention Resolution

We give a 1.488-approximation for the classic scheduling problem of mini...

Identifying influential patents in citation networks using enhanced VoteRank centrality

This study proposes the usage of a method called VoteRank, created by Zh...
This week in AI

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