Improved Approximation Algorithms for Min-Cost Connectivity Augmentation Problems

2016 ◽  
pp. 324-339
Author(s):  
Zeev Nutov
Keyword(s):  
Approximation Algorithms ◽  
Connectivity Augmentation

scholarly journals On the Cycle Augmentation Problem: Hardness and Approximation Algorithms

2021 ◽  
Author(s):  
Waldo Gálvez ◽  
Fabrizio Grandoni ◽  
Afrouz Jabal Ameli ◽  
Krzysztof Sornat
Keyword(s):  
Approximation Algorithms ◽  
Connected Graph ◽  
Minimum Size ◽  
Single Cycle ◽  
Integrality Gap ◽  
Connectivity Augmentation ◽  
Special Case ◽  
Better Than

AbstractIn the k-Connectivity Augmentation Problem we are given a k-edge-connected graph and a set of additional edges called links. Our goal is to find a set of links of minimum size whose addition to the graph makes it (k + 1)-edge-connected. There is an approximation preserving reduction from the mentioned problem to the case k = 1 (a.k.a. the Tree Augmentation Problem or TAP) or k = 2 (a.k.a. the Cactus Augmentation Problem or CacAP). While several better-than-2 approximation algorithms are known for TAP, for CacAP only recently this barrier was breached (hence for k-Connectivity Augmentation in general). As a first step towards better approximation algorithms for CacAP, we consider the special case where the input cactus consists of a single cycle, the Cycle Augmentation Problem (CycAP). This apparently simple special case retains part of the hardness of the general case. In particular, we are able to show that it is APX-hard. In this paper we present a combinatorial $\left (\frac {3}{2}+\varepsilon \right )$ 3 2 + ε -approximation for CycAP, for any constant ε > 0. We also present an LP formulation with a matching integrality gap: this might be useful to address the general case of the problem.

scholarly journals Structured Connectivity Augmentation

2018 ◽  
Vol 32 (4) ◽  
pp. 2612-2635
Author(s):  
Fedor V. Fomin ◽  
Petr A. Golovach ◽  
Dimitrios M. Thilikos
Keyword(s):  
Connectivity Augmentation
Sign in / Sign up

Export Citation Format

Share Document