AI Chat AI Image Generator AI Video Text to Speech

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

05/09/2023

∙

by Ali Çivril, et al.

∙

∙

We provide an algorithm for the minimum 2-vertex-connected spanning subgraph problem with approximation ratio 4/3, improving upon the previous best factor 10/7.

page 1

page 2

page 3

page 4

research

∙ 01/11/2020

Minimum 2-vertex-twinless connected spanning subgraph problem

Given a 2-vertex-twinless connected directed graph G=(V,E), the minimum ...

0 Raed Jaberi, et al. ∙

research

∙ 01/15/2021

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

We give a randomized 1+√(8ln k/k)-approximation algorithm for the minimu...

0 Anna R. Karlin, et al. ∙

research

∙ 05/03/2023

A 4/3 Approximation for 2-Vertex-Connectivity

The 2-Vertex-Connected Spanning Subgraph problem (2VCSS) is among the mo...

0 Miguel Bosch-Calvo, et al. ∙

research

∙ 11/28/2022

Special Cases of the Minimum Spanning Tree Problem under Explorable Edge and Vertex Uncertainty

This article studies the Minimum Spanning Tree Problem under Explorable ...

0 Corinna Mathwieser, 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

∙ 09/17/2020

p-Edge/Vertex-Connected Vertex Cover: Parameterized and Approximation Algorithms

We introduce and study two natural generalizations of the Connected Vert...

0 Carl Einarson, et al. ∙