Improved Algorithm for Degree Bounded Survivable Network Design Problem
Data Structures and Algorithms
2010-07-08 v1
Abstract
We consider the Degree-Bounded Survivable Network Design Problem: the objective is to find a minimum cost subgraph satisfying the given connectivity requirements as well as the degree bounds on the vertices. If we denote the upper bound on the degree of a vertex v by b(v), then we present an algorithm that finds a solution whose cost is at most twice the cost of the optimal solution while the degree of a degree constrained vertex v is at most 2b(v) + 2. This improves upon the results of Lau and Singh and that of Lau, Naor, Salavatipour and Singh.
Cite
@article{arxiv.0911.4544,
title = {Improved Algorithm for Degree Bounded Survivable Network Design Problem},
author = {Anand Louis and Nisheeth Vishnoi},
journal= {arXiv preprint arXiv:0911.4544},
year = {2010}
}