Degree constrained node-connectivity problems

Research output: Contribution to journalArticlepeer-review


We consider Degree Constrained Survivable Network problems. For the directed Degree Constrained k -Edge-Outconnected Subgraph problem, we slightly improve the best known approximation ratio, by a simple proof. Our main contribution is giving a framework to handle node-connectivity degree constrained problems with the iterative rounding method. In particular, for the degree constrained versions of the Element-Connectivity Survivable Network problem on undirected graphs, and of the k -Outconnected Subgraph problem on both directed and undirected graphs, our algorithm computes a solution J of cost O(logk) times the optimal, with degrees O(2 k )·b(v). Similar result are obtained for the k -Connected Subgraph problem. The latter improves on the only degree approximation O(klogn)·b(v) in O(n k ) time on undirected graphs by Feder, Motwani, and Zhu.

Original languageEnglish
Pages (from-to)340-364
Number of pages25
Issue number2
StatePublished - Oct 2014


  • Approximation algorithms
  • Degree bounds
  • Network design
  • Node-connectivity

All Science Journal Classification (ASJC) codes

  • General Computer Science
  • Applied Mathematics
  • Computer Science Applications


Dive into the research topics of 'Degree constrained node-connectivity problems'. Together they form a unique fingerprint.

Cite this