Improved Algorithm for Degree Bounded Survivable Network Design Problem

TL;DR

This paper introduces an improved approximation algorithm for the Degree-Bounded Survivable Network Design Problem, achieving a better cost and degree bound approximation than previous methods.

Contribution

The authors present a new algorithm that guarantees a solution with at most twice the optimal cost and degree bounds within 2b(v)+2, improving prior results.

Findings

Cost of solution at most twice the optimal

Degree bounds at most 2b(v)+2

Improved approximation ratios over previous work

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.