2008/01/27 by Daniel Andersson, Andersson, Daniel
Business, Management and Accounting · Engineering · #Computer Science and Game Theory (cs.GT) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Facility Location and Emergency Management #Infrastructure Resilience and Vulnerability Analysis #Smart Grid Security and Resilience
paper · pdf · doi:10.48550/arxiv.0801.4130
openalex publication_date 2008/01/27 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We refine existing general network optimization techniques, give new characterizations for the class of problems to which they can be applied, and show that they can also be used to solve various two-player games in almost linear time. Among these is a new variant of the network interdiction problem, where the interdictor wants to destroy high-capacity paths from the source to the destination using a vertex-wise limited budget of arc removals. We also show that replacing the limit average in mean payoff games by the maximum weight results in a class of games amenable to these techniques.