mlsanityData to 14 Oct 2026

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

arXiv 2101.05921 ↗First posted 15 Jan 2021cs.DS math.CO math.PRcited by 1

Not on the map. Why?

Abstract (arXiv)

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

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

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2022: 1.

1 paper.

  1. 2022Optimal Sublinear Sampling of Spanning Trees and Determinantal Point Processes via Average-Case Entropic Independencecited by 8