9/7-Approximation for Two-Edge-Connectivity and Two-Vertex-Connectivity
Abstract
We provide algorithms for the minimum 2-edge-connected spanning subgraph problem and the minimum 2-vertex-connected spanning subgraph problem with approximation ratio 97. This improves upon a recent algorithm with ratio slightly smaller than 43 for 2-edge-connectivity, and another one with ratio 43 for 2-vertex-connectivity.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.