Abstract:In the 2-Vertex-Connected Spanning Subgraph problem (2-VCSS), we are given an undirected graph $G$, and the objective is to find a 2-vertex-connected spanning subgraph $S$ of $G$ with the minimum number of edges. In the context of survivable network design, 2-VCSS is one of the most fundamental and well-studied problems. There has been active research on improving the approximation ratio of algorithms, and the current best ratio is $\frac{4}{3}$, achieved by Bosch-Calvo, Grandoni, and Jabal this http URL this paper, we improve the approximation ratio to $\frac{21}{16}+\varepsilon$ ($<1.313$). The key idea in our algorithm is to introduce a 2-edge-cover without certain cycle components, and use it as an initial solution.
From: Yusuke Kobayashi [view email]
[v1]
Mon, 11 May 2026 06:34:57 UTC (194 KB)
[v2]
Thu, 13 Aug 2026 05:52:37 UTC (245 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。