Adaptive Network Flow with k-Arc Destruction

MaRDI QIDQ6293410zbMATH OpenFDO

Authors Thomas Ridremont, Dimitri Watel, Pierre-Louis Poirion, Christophe Picouleau

Publication date 2 November 2017

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$.

This page was built for publication: Adaptive Network Flow with $k$-Arc Destruction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6293410)