An Improved Approximation Algorithm for the Minimum $k$-Edge Connected Multi-Subgraph Problem
Anna R. Karlin, Nathan Klein, Shayan Oveis Gharan, Xinzhi Zhang
·
2021-01-15
·
via math.PR updates on arXiv.org
We give a randomized $1+\frac{5.06}{\sqrt{k}}$-approximation algorithm for the minimum $k$-edge connected spanning multi-subgraph problem, $k$-ECSM.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。