A new approximation algorithm improves the ratio for 2-vertex-connected spanning subgraphs to 95/72 + ε by starting from a cycle-restricted 2-edge-cover.
Hunkenschr¨ oder, S
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
An Approximation Algorithm for 2-Vertex-Connectivity via Cycle-Restricted 2-Edge-Covers
A new approximation algorithm improves the ratio for 2-vertex-connected spanning subgraphs to 95/72 + ε by starting from a cycle-restricted 2-edge-cover.