Survival Network Design of Doubling Dimension Metrics

TL;DR

This paper presents a polynomial-time randomized algorithm that approximates the minimum weight 2-edge-connected spanning subgraph in metric spaces with doubling dimension, achieving near-optimal solutions.

Contribution

It introduces the first polynomial-time $(1+ ext{epsilon})$-approximation algorithm for 2-ECSS in doubling dimension metrics, expanding understanding of network design in complex metric spaces.

Findings

Achieves a $(1+ ext{epsilon})$-approximation in polynomial time

Applies to arbitrary metric spaces with doubling dimension

Advances approximation algorithms for network connectivity problems

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 $(1+\epsilon)$-approximation algorithm.