An Improved Approximation Algorithm for the Minimum $k$-Edge Connected Multi-Subgraph Problem

arxiv（2022）

引用 0|浏览22

暂无评分

摘要

We give a randomized $1+\frac{5.06}{\sqrt{k}}$-approximation algorithm for the minimum $k$-edge connected spanning multi-subgraph problem, $k$-ECSM.

查看译文

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要