A Unified Approach for Approximating 2-Edge-Connected Spanning Subgraph and 2-Vertex-Connected Spanning Subgraph
Data Structures and Algorithms
2024-07-16 v9
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 both . Using a common theme, the algorithms and their analyses are very similar.
Keywords
Cite
@article{arxiv.2305.05398,
title = {A Unified Approach for Approximating 2-Edge-Connected Spanning Subgraph and 2-Vertex-Connected Spanning Subgraph},
author = {Ali Çivril},
journal= {arXiv preprint arXiv:2305.05398},
year = {2024}
}