Hardness of robust network design

C. Chekuri, F. B. Shepherd, G. Oriolo, M. G. Scutellá

Research output: Contribution to journalArticlepeer-review


The authors settle the complexity status of the robust network design problem in undirected graphs. The fact that the flow-cut gap in general graphs can be large, poses some difficulty in establishing a hardness result. Instead, the authors introduce a single-source version of the problem where the flow-cut gap is known to be one. They then show that this restricted problem is coNP-Hard. This version also captures, as special cases, the fractional relaxations of several problems including the spanning tree problem, the Steiner tree problem, and the shortest path problem.

Original languageEnglish (US)
Pages (from-to)50-54
Number of pages5
Issue number1
StatePublished - Aug 2007
Externally publishedYes


  • Network design
  • Robust optimization
  • Single-source hose model

ASJC Scopus subject areas

  • Information Systems
  • Computer Networks and Communications


Dive into the research topics of 'Hardness of robust network design'. Together they form a unique fingerprint.

Cite this