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

01/15/2021

∙

by   Anna R. Karlin, et al.

∙

0

∙

share

We give a randomized 1+√(8ln k/k)-approximation algorithm for the minimum k-edge connected spanning multi-subgraph problem, k-ECSM.