paper

Two-connected spanning subgraphs with at most OPT edges

arXiv:1609.00147

Abstract

We present a -approximation algorithm for the minimum two-vertex-connected spanning subgraph problem.