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

arXiv: https://arxiv.org/abs/2101.05921 · HTML: https://mlsanity.com/paper/2101.05921/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 15 Jan 2021.

## Built on by (most cited first, 1 of 1)

- [Optimal Sublinear Sampling of Spanning Trees and Determinantal Point Processes via Average-Case Entropic Independence](https://mlsanity.com/paper/2204.02570/) (2022)

## Abstract (arXiv)

We give a randomized 1+frac5.06√k-approximation algorithm for the minimum k-edge connected spanning multi-subgraph problem, k-ECSM.