Adaptive Network Flow with k-Arc Destruction
share
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.
READ FULL TEXT