Iterative rounding approximation algorithms for degree-bounded node-connectivity network design

Takuro Fukunaga, Zeev Nutov, R. Ravi

We consider the problem of finding a minimum edge cost subgraph of a graph satisfying both given node-connectivity requirements and degree upper bounds on nodes. We present an iter…