Adaptive Network Flow with $k$-Arc Destruction

Abstract : When a flow is not allowed to be reoriented the Maximum Residual Flow Problem with $k$-Arc Destruction is known to be $NP$-hard for $k=2$. We show that when a flow is allowed to be adaptive the problem becomes polynomial for every fixed $k$.
Complete list of metadatas
Contributor : Christophe Picouleau <>
Submitted on : Wednesday, January 15, 2020 - 3:19:00 PM
Last modification on : Saturday, February 1, 2020 - 1:52:29 AM

Links full text


  • HAL Id : hal-02440948, version 1
  • ARXIV : 1711.00831


Thomas Ridremont, Dimitri Watel, Pierre-Louis Poirion, Christophe Picouleau. Adaptive Network Flow with $k$-Arc Destruction. 2020. ⟨hal-02440948⟩



Record views