Adaptive Network Flow with k-Arc Destruction

11/02/2017

∙

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

Adaptive Network Flow with k-Arc Destruction

On Polynomial-Time Combinatorial Algorithms for Maximum L-Bounded Flow

Robust static and dynamic maximum flows

An Iterative Security Game for Computing Robust and Adaptive Network Flows

Novel approach for solving a variant of equal flow problem

Generalized Parametric Path Problems

Dynamic Flows with Time-Dependent Capacities

Optimal Sensor Deception to Deviate from an Allowed Itinerary

Adaptive Network Flow with k-Arc Destruction

Related Research

On Polynomial-Time Combinatorial Algorithms for Maximum L-Bounded Flow

Robust static and dynamic maximum flows

An Iterative Security Game for Computing Robust and Adaptive Network Flows

Novel approach for solving a variant of equal flow problem

Generalized Parametric Path Problems

Dynamic Flows with Time-Dependent Capacities

Optimal Sensor Deception to Deviate from an Allowed Itinerary