On the complexity of the one-terminal network design problem

  • Authors:

  • Nimrod Megiddo

  • Affiliations:

  • Department of Statistics, Faculty of Social Sciences and Mathematical Sciences, Tel Aviv University, Ramat-Aviv, Tel Aviv, Israel

  • Venue:
  • Operations Research Letters
  • Year:
  • 1982

Quantified Score

Hi-index 0.00

Visualization

Abstract

The one-terminal network design problem considered here is to select a subset of the set of potential edges so as to minimize the sum of construction cost plus expected usage cost with discounting. We distinguish between easy and hard cases of this problem.