9/7-Approximation for Two-Edge-Connectivity and Two-Vertex-Connectivity
Data Structures and Algorithms
2024-09-27 v2
Abstract
We provide algorithms for the minimum 2-edge-connected spanning subgraph problem and the minimum 2-vertex-connected spanning subgraph problem with approximation ratio . This improves upon a recent algorithm with ratio slightly smaller than for 2-edge-connectivity, and another one with ratio for 2-vertex-connectivity.
Cite
@article{arxiv.2407.10526,
title = {9/7-Approximation for Two-Edge-Connectivity and Two-Vertex-Connectivity},
author = {Ali Çivril},
journal= {arXiv preprint arXiv:2407.10526},
year = {2024}
}
Comments
16 pages. The result is extended to 2-VCSS. Definitions and analysis changed accordingly