We give a randomized $1+\frac{5.06}{\sqrt{k}}$-approximation algorithm for the minimum $k$-edge connected spanning multi-subgraph problem, $k$-ECSM.
翻译:我们给出一个随机化的1美元(frac{5.06unsqrt{k ⁇ $-accolation)算法,