An Improved Approximation Algorithm for the Minimum $k$-Edge Connected Multi-Subgraph Problem
Data Structures and Algorithms
2022-05-23 v2 Combinatorics
Probability
Abstract
We give a randomized -approximation algorithm for the minimum -edge connected spanning multi-subgraph problem, -ECSM.
Keywords
Cite
@article{arxiv.2101.05921,
title = {An Improved Approximation Algorithm for the Minimum $k$-Edge Connected Multi-Subgraph Problem},
author = {Anna R. Karlin and Nathan Klein and Shayan Oveis Gharan and Xinzhi Zhang},
journal= {arXiv preprint arXiv:2101.05921},
year = {2022}
}