AI Chat AI Image Generator AI Video Text to Speech

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

01/15/2021

∙

by Anna R. Karlin, et al.

∙

∙

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

Anna R. Karlin
9 publications
Nathan Klein
9 publications
Shayan Oveis Gharan
25 publications
Xinzhi Zhang
7 publications

page 1

page 2

page 3

page 4

research

∙ 05/09/2023

An Improved Approximation Algorithm for the Minimum 2-Vertex-Connected Spanning Subgraph Problem

We provide an algorithm for the minimum 2-vertex-connected spanning subg...

0 Ali Çivril, et al. ∙

research

∙ 11/17/2019

5/4-Approximation of Minimum 2-Edge-Connected Spanning Subgraph

We provide a 5/4-approximation algorithm for the 2-edge connected spanni...

0 Ali Çivril, et al. ∙

research

∙ 04/26/2023

An Approximation Algorithm for Two-Edge-Connected Subgraph Problem via Triangle-free Two-Edge-Cover

The 2-Edge-Connected Spanning Subgraph problem (2-ECSS) is one of the mo...

0 Yusuke Kobayashi, et al. ∙

research

∙ 12/20/2019

An Õ(log^2 n)-approximation algorithm for 2-edge-connected dominating set

In the Connected Dominating Set problem we are given a graph G=(V,E) and...

0 Amir Belgi, et al. ∙

research

∙ 05/09/2023

4/3-Approximation of Graphic TSP

We describe a 4/3-approximation algorithm for the traveling salesman pro...

0 Ali Çivril, et al. ∙

research

∙ 05/30/2022

Approximating k-Edge-Connected Spanning Subgraphs via a Near-Linear Time LP Solver

In the k-edge-connected spanning subgraph (kECSS) problem, our goal is t...

0 Parinya Chalermsook, et al. ∙

research

∙ 08/14/2018

A Simple Primal-Dual Approximation Algorithm for 2-Edge-Connected Spanning Subgraphs

We propose a very simple and natural approximation algorithm for the pro...

0 Stephan Beyer, et al. ∙