The maximum residual flow problem: NP-hardness with two-arc destruction

  • Authors:

  • Donglei Du;R. Chandrasekaran

  • Affiliations:

  • Faculty of Business Administration, University of New Brunswick, Fredericton, New Brunswick, Canada E3B 5A3;Department of Computer Sciences, University of Texas at Dallas, Richardson, Texas 75083

  • Venue:
  • Networks
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

The maximum residual flow problem with one-arc destruction is shown to be solvable in strongly polynomial time in [Aneja et al., Networks, 38 (2001), 194–198]. However, the status of the corresponding problem with more than one-arc destruction is left open therein. We resolve the status of the two-arc destruction problem by demonstrating that it is already NP-hard. © 2007 Wiley Periodicals, Inc. NETWORKS, Vol. 50(3), 181–182 2007