Two-connected spanning subgraphs with at most 107OPT edges
Abstract
We present a 107-approximation algorithm for the minimum two-vertex-connected spanning subgraph problem.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.