%0 Journal Article
%T Survival Network Design of Doubling Dimension Metrics
%A Hao-Hsiang Hung
%J Computer Science
%D 2012
%I arXiv
%X 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+\epsilon)$-approximation algorithm.
%U http://arxiv.org/abs/1210.5729v1