A New Approximation Algorithm for the Minimum 2-Edge-Connected Spanning Subgraph Problem
Abstract
We present a new approximation algorithm for the minimum 2-edge-connected spanning subgraph problem. Its approximation ratio is 43, which matches the current best ratio. The approximation ratio of the algorithm is 65 on subcubic graphs, which is an improvement upon the previous best ratio of 54. The algorithm is a novel extension of the primal-dual schema, which consists of two distinct phases. Both the algorithm and the analysis are much simpler than those of the previous approaches.
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.