Removing Arcs from a Network

This paper proposes an algorithm for making a sensitivity analysis on a flow network, specifically, the problem of removing n arcs in a network such that the reduction in the maximum flow between an origin and destination node is maximized. Such an algorithm might be helpful in determining how sensitive a transportation system is to having its roads closed for repairs.