Efficient Algorithms for Interdicting Facilities in Trees and Bounded Treewidth Graphs

Ali Abbasi, Eli Friedman, Leana Golubchik +2

Given a graph $G$ of $n$ nodes partitioned into facilities and customers, the $r$-edge interdiction covering problem (REIC) is to remove up to $r$ edges so as to maximize the total…