Improved Algorithm for Degree Bounded Survivable Network Design Problem

Details Improved Algorithm for Degree Bounded Survivable Network Design Problem Improved Algorithm for Degree Bounded Survivable Network Design Problem

2009-11-24

arxiv.org/abs/0911.4544v1

Computer Science

Data Structures and Algorithms

Scientific paper

10.1007/978-3-642-13731-0_38

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.

Affiliated with

Also associated with

No associations

Rating

Improved Algorithm for Degree Bounded Survivable Network Design Problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Improved Algorithm for Degree Bounded Survivable Network Design Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Improved Algorithm for Degree Bounded Survivable Network Design Problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-279538