Survival Network Design of Doubling Dimension Metrics
arXiv:1210.5729
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 -approximation algorithm.