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}$.

翻译：我们提出一个近似比为$\frac{4}{3}$的算法解决最小2-顶点连通生成子图问题，改进了此前最优的$\frac{10}{7}$因子。