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

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.

• Type: Journal
• Year: 2007
• Where: NETWORKS
• Authors: Donglei Du, R. Chandrasekaran
• Keywords: Computer Networks, NETWORKS 2007, One-arc Destruction, Residual flow Problem, Two-arc Destruction Problem