An Improved Approximation Algorithm for the Minimum 2-Vertex-Connected Spanning Subgraph Problem
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.
READ FULL TEXT