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

Klaus Heeger, Jens Vygen

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