We provide an algorithm for the minimum 2-vertex-connected spanning subgraph problem with approximation ratio $\frac{4}{3}$, improving upon the previous best factor $\frac{10}{7}$.
翻译:暂无翻译