摘要

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 is at most , where is the maximum connectivity requirement and is the given degree bound on . This unifies, simplifies, and improves the previous results for this problem.