Survival Network Design of Doubling Dimension Metrics
  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. 
Hao-Hsiang Hung
cs.DS