  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.
