A New Approximation Algorithm for the Minimum 2-Edge-Connected Spanning Subgraph Problem
Data Structures and Algorithms
2023-05-10 v8
Abstract
We present a new approximation algorithm for the minimum 2-edge-connected spanning subgraph problem. Its approximation ratio is , which matches the current best ratio. The approximation ratio of the algorithm is on subcubic graphs, which is an improvement upon the previous best ratio of . The algorithm is a novel extension of the primal-dual schema, which consists of two distinct phases. Both the algorithm and the analysis are much simpler than those of the previous approaches.
Keywords
Cite
@article{arxiv.1911.07232,
title = {A New Approximation Algorithm for the Minimum 2-Edge-Connected Spanning Subgraph Problem},
author = {Ali Çivril},
journal= {arXiv preprint arXiv:1911.07232},
year = {2023}
}
Comments
14 pages, appeared in TCS