A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Additive Approximation for Bounded Degree Survivable Network Design

2013
*
SIAM journal on computing (Print)
*

In the minimum bounded degree Steiner network problem, we are given an undirected graph with an edge cost for each edge, a connectivity requirement r uv for each pair of vertices u and v, and a degree upper bound b v for each vertex v. The task is to find a minimum cost subgraph that satisfies all the connectivity requirements and degree upper bounds. Let r max := max u,v {r uv } and OPT be the cost of an optimal solution that satisfies all the degree bounds. We present approximation algorithms

doi:10.1137/110854461
fatcat:7jzwaplyivaltpve6atoymdfyq