Approximation algorithms for connectivity augmentation problems

09/28/2020
by   Zeev Nutov, et al.
0

In Connectivity Augmentation problems we are given a graph H=(V,E_H) and an edge set E on V, and seek a min-size edge set J ⊆ E such that H ∪ J has larger edge/node connectivity than H. In the Edge-Connectivity Augmentation problem we need to increase the edge-connectivity by 1. In the Block-Tree Augmentation problem H is connected and H ∪ S should be 2-connected. In Leaf-to-Leaf Connectivity Augmentation problems every edge in E connects minimal deficient sets. For this version we give a simple combinatorial approximation algorithm with ratio 5/3, improving the previous 1.91 approximation that applies for the general case. We also show by a simple proof that if the Steiner Tree problem admits approximation ratio α then the general version admits approximation ratio 1+ln(4-x)+ϵ, where x is the solution to the equation 1+ln(4-x)=α+(α-1)x. For the currently best value of α=ln 4+ϵ this gives ratio 1.942. This is slightly worse than the best ratio 1.91, but has the advantage of using Steiner Tree approximation as a "black box", giving ratio < 1.9 if ratio α≤ 1.35 can be achieved.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/10/2020

2-node-connectivity network design

We consider network design problems in which we are given a graph G=(V,E...
research
07/04/2023

Improved approximation algorithms for some capacitated k edge connectivity problems

We consider the following two variants of the Capacitated k-Edge Connect...
research
11/03/2021

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...
research
08/04/2021

Node Connectivity Augmentation via Iterative Randomized Rounding

Many network design problems deal with the design of low-cost networks t...
research
09/14/2022

Parameterized algorithms for node connectivity augmentation problems

A graph G is k-out-connected from its node s if it contains k internally...
research
04/18/2020

The (2,k)-connectivity augmentation problem: Algorithmic aspects

Durand de Gevigney and Szigeti <cit.> have recently given a min-max theo...
research
09/16/2022

A (1.5+ε)-Approximation Algorithm for Weighted Connectivity Augmentation

Connectivity augmentation problems are among the most elementary questio...

Please sign up or login with your details

Forgot password? Click here to reset