Survival Network Design of Doubling Dimension Metrics
Abstract
We investigate the Minimum Weight 2-Edge-Connected Spanning Subgraph (2-ECSS) problem in an arbitrary metric space of doubling dimension and show a polynomial time randomized (1+ε)-approximation algorithm.
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.