A 4/3 Approximation for 2-Vertex-Connectivity

05/03/2023
by   Miguel Bosch-Calvo, et al.
0

The 2-Vertex-Connected Spanning Subgraph problem (2VCSS) is among the most basic NP-hard (Survivable) Network Design problems: we are given an (unweighted) undirected graph G. Our goal is to find a subgraph S of G with the minimum number of edges which is 2-vertex-connected, namely S remains connected after the deletion of an arbitrary node. 2VCSS is well-studied in terms of approximation algorithms, and the current best (polynomial-time) approximation factor is 10/7 by Heeger and Vygen [SIDMA'17] (improving on earlier results by Khuller and Vishkin [STOC'92] and Garg, Vempala and Singla [SODA'93]).

READ FULL TEXT

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...
research
09/21/2022

Improved Approximation for Two-Edge-Connectivity

The basic goal of survivable network design is to construct low-cost net...
research
04/04/2018

Losing Treewidth by Separating Subsets

We study the problem of deleting the smallest set S of vertices (resp.ed...
research
11/24/2022

Multiagent MST Cover: Pleasing All Optimally via A Simple Voting Rule

Given a connected graph on whose edges we can build roads to connect the...
research
10/14/2022

Performance evaluation of approximation algorithms for the minimum size 2-vertex strongly connected subgraph problem

Jaberi [7] presented approximation algorithms for the problem of computi...
research
08/26/2019

Constraint Generation Algorithm for the Minimum Connectivity Inference Problem

Given a hypergraph H, the Minimum Connectivity Inference problem asks fo...
research
01/05/2018

Sparse highly connected spanning subgraphs in dense directed graphs

Mader (1985) proved that every strongly k-connected n-vertex digraph con...

Please sign up or login with your details

Forgot password? Click here to reset