1. A $5/4$ Approximation for Two-Edge-Connectivity
- Author
-
Bosch-Calvo, Miguel, Grandoni, Fabrizio, and Ameli, Afrouz Jabal
- Subjects
Computer Science - Data Structures and Algorithms ,Mathematics - Combinatorics ,68W25 (Primary) 68W40, 68R10, 05C40, 05C85 (Secondary) ,F.2.2 - Abstract
The $2$-Edge Connected Spanning Subgraph problem (2ECSS) is among the most basic survivable network design problems: given an undirected unweighted graph, find a subgraph with the minimum number of edges which is 2-edge-connected (i.e., it remains connected after the removal of any single edge). This NP-hard problem is well-studied in terms of approximation algorithms. The current-best approximation factor for 2ECSS is $1.3+\varepsilon$ for any constant $\varepsilon >0$ [Garg, Grandoni, Jabal-Ameli'23; Kobayashi,Noguchi'23]. In this paper we present a much simpler $9/7$ approximation algorithm, and a more complex $5/4$ one. Our algorithms are also faster: their running time is $n^{O(1)}$ instead of $n^{O(1/\varepsilon)}$., Comment: 61 pages, 5 figures
- Published
- 2024