Survival Network Design of Doubling Dimension Metrics
Data Structures and Algorithms
2012-10-23 v1
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.
Keywords
Cite
@article{arxiv.1210.5729,
title = {Survival Network Design of Doubling Dimension Metrics},
author = {Hao-Hsiang Hung},
journal= {arXiv preprint arXiv:1210.5729},
year = {2012}
}