A unified algorithm for degree bounded survivable network design

We present an approximation algorithm for the minimum bounded degree Steiner network problem that returns a Steiner network of cost at most two times the optimal and the degree on each vertex v is at most min{b_v + 3r_max, 2b_v+2} , where r_max is the maximum connectivity requirement and b_v is the given degree bound on v . This unifies, simplifies, and improves the previous results for this problem.