Two-connected spanning subgraphs with at most $\frac{10}{7}$OPT edges

TL;DR

This paper introduces a new approximation algorithm for the minimum two-vertex-connected spanning subgraph problem, achieving a ratio of 10/7, which improves the efficiency of constructing such subgraphs.

Contribution

It presents a novel 10/7-approximation algorithm for the problem, advancing the state of the art in approximation ratios.

Findings

Achieves a 10/7 approximation ratio.

Provides an efficient algorithm for the problem.

Improves upon previous approximation bounds.

Abstract

We present a $\frac{10}{7}$-approximation algorithm for the minimum two-vertex-connected spanning subgraph problem.