Skip to main content
Article thumbnail
Location of Repository

Hardness of Robust Network Design

By C. Chekuri, G. Oriolo, M. G. Scutella and F. B. Shepherd

Abstract

We settle the complexity status of the robust network design problem in undirected graphs by showing that the single-source hose design problem is coNP-Hard. This single-source model captures, as special cases, the fractional relaxations of several problems including the spanning tree problem, the Steiner tree problem, and the path trees problem

Topics: network design, single-source hose model, robust optimization
Year: 2009
OAI identifier: oai:CiteSeerX.psu:10.1.1.135.8786
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.math.mcgill.ca/~bsh... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.