Document
##### Approximation Algorithms for Flexible Graph Connectivity

Published in: LIPIcs, Volume 213, 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2021)

##### Abstract
We present approximation algorithms for several network design problems in the model of Flexible Graph Connectivity (Adjiashvili, Hommelsheim and Mühlenthaler, "Flexible Graph Connectivity", Math. Program. pp. 1-33 (2021), IPCO 2020: pp. 13-26). In an instance of the Flexible Graph Connectivity (FGC) problem, we have an undirected connected graph G = (V,E), a partition of E into a set of safe edges S and a set of unsafe edges U, and nonnegative costs {c_e}_{e ∈ E} on the edges. A subset F ⊆ E of edges is feasible for FGC if for any unsafe edge e ∈ F ∩ U, the subgraph (V,F⧵{e}) is connected. The algorithmic goal is to find a (feasible) solution F that minimizes c(F) = ∑_{e ∈ F} c_e. We present a simple 2-approximation algorithm for FGC via a reduction to the minimum-cost r-out 2-arborescence problem. This improves upon the 2.527-approximation algorithm of Adjiashvili et al. For integers p ≥ 1 and q ≥ 0, the (p,q)-FGC problem is a generalization of FGC where we seek a minimum-cost subgraph H = (V,F) that remains p-edge connected against the failure of any set of at most q unsafe edges; that is, for any set F' ⊆ U with |F'| ≤ q, H-F' = (V, F ⧵ F') should be p-edge connected. Note that FGC corresponds to the (1,1)-FGC problem. We give approximation algorithms for two important special cases of (p,q)-FGC: (a) Our 2-approximation algorithm for FGC extends to a (k+1)-approximation algorithm for the (1,k)-FGC problem. (b) We present a 4-approximation algorithm for the (k,1)-FGC problem. For the unweighted FGC problem, where each edge has unit cost, we give a 16/11-approximation algorithm. This improves on the result of Adjiashvili et al. for this problem. The (p,q)-FGC model with p = 1 or q ≤ 1 can be cast as the Capacitated k-Connected Subgraph problem which is a special case of the well-known Capacitated Network Design problem. We denote the former problem by Cap-k-ECSS. An instance of this problem consists of an undirected graph G = (V,E), nonnegative integer edge-capacities {u_e}_{e ∈ E}, nonnegative edge-costs {c_e}_{e ∈ E}, and a positive integer k. The goal is to find a minimum-cost edge-set F ⊆ E such that every (non-trivial) cut of the capacitated subgraph H(V,F,u) has capacity at least k. We give a min(k, 2max_{e ∈ E} u_e)-approximation algorithm for this problem.

##### Cite as

Sylvia Boyd, Joseph Cheriyan, Arash Haddadan, and Sharat Ibrahimpur. Approximation Algorithms for Flexible Graph Connectivity. In 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 213, pp. 9:1-9:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)

```@InProceedings{boyd_et_al:LIPIcs.FSTTCS.2021.9,
author =	{Boyd, Sylvia and Cheriyan, Joseph and Haddadan, Arash and Ibrahimpur, Sharat},
title =	{{Approximation Algorithms for Flexible Graph Connectivity}},
booktitle =	{41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2021)},
pages =	{9:1--9:14},
series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN =	{978-3-95977-215-0},
ISSN =	{1868-8969},
year =	{2021},
volume =	{213},
editor =	{Boja\'{n}czyk, Miko{\l}aj and Chekuri, Chandra},
publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2021.9},
URN =		{urn:nbn:de:0030-drops-155206},
doi =		{10.4230/LIPIcs.FSTTCS.2021.9},
annote =	{Keywords: Approximation Algorithms, Combinatorial Optimization, Network Design, Edge-Connectivity of Graphs, Reliability of Networks}
}```
Document
##### Towards Improving Christofides Algorithm for Half-Integer TSP

Published in: LIPIcs, Volume 144, 27th Annual European Symposium on Algorithms (ESA 2019)

##### Abstract
We study the traveling salesman problem (TSP) in the case when the objective function of the subtour linear programming relaxation is minimized by a half-cycle point: x_e in {0,1/2,1} where the half-edges form a 2-factor and the 1-edges form a perfect matching. Such points are sufficient to resolve half-integer TSP in general and they have been conjectured to demonstrate the largest integrality gap for the subtour relaxation. For half-cycle points, the best-known approximation guarantee is 3/2 due to Christofides' famous algorithm. Proving an integrality gap of alpha for the subtour relaxation is equivalent to showing that alpha x can be written as a convex combination of tours, where x is any feasible solution for this relaxation. To beat Christofides' bound, our goal is to show that (3/2 - epsilon)x can be written as a convex combination of tours for some positive constant epsilon. Let y_e = 3/2-epsilon when x_e = 1 and y_e = 3/4 when x_e = 1/2. As a first step towards this goal, our main result is to show that y can be written as a convex combination of tours. In other words, we show that we can save on 1-edges, which has several applications. Among them, it gives an alternative algorithm for the recently studied uniform cover problem. Our main new technique is a procedure to glue tours over proper 3-edge cuts that are tight with respect to x, thus reducing the problem to a base case in which such cuts do not occur.

##### Cite as

Arash Haddadan and Alantha Newman. Towards Improving Christofides Algorithm for Half-Integer TSP. In 27th Annual European Symposium on Algorithms (ESA 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 144, pp. 56:1-56:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019)

```@InProceedings{haddadan_et_al:LIPIcs.ESA.2019.56,
title =	{{Towards Improving Christofides Algorithm for Half-Integer TSP}},
booktitle =	{27th Annual European Symposium on Algorithms (ESA 2019)},
pages =	{56:1--56:12},
series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN =	{978-3-95977-124-5},
ISSN =	{1868-8969},
year =	{2019},
volume =	{144},
editor =	{Bender, Michael A. and Svensson, Ola and Herman, Grzegorz},
publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2019.56},
URN =		{urn:nbn:de:0030-drops-111772},
doi =		{10.4230/LIPIcs.ESA.2019.56},
annote =	{Keywords: Traveling salesman problem, subtour elimination relaxation, integrality gap, gluing subtours}
}```
• Refine by Author
• 1 Boyd, Sylvia
• 1 Cheriyan, Joseph
• 1 Ibrahimpur, Sharat
• 1 Newman, Alantha

• Refine by Classification
• 1 Mathematics of computing → Combinatorial optimization
• 1 Theory of computation → Approximation algorithms analysis

• Refine by Keyword
• 1 Approximation Algorithms
• 1 Combinatorial Optimization
• 1 Edge-Connectivity of Graphs
• 1 Network Design
• 1 Reliability of Networks

• Refine by Type
• 2 document

• Refine by Publication Year
• 1 2019
• 1 2021

X

Feedback for Dagstuhl Publishing