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

preprint2022arXivOpen access

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

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Write a reviewWrite

No reviews yet.

Add a commentWrite

No comments yet.

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

Abstract

Connections

Building this map preview

Reviews 0

Discussion 0

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

Abstract

Connections

Building this map preview

Reviews 0

Discussion 0

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