Work

Interdiction Problems on Planar Graphs

Year: 2013

Type: preprint

Abstract: Interdiction problems are leader-follower games in which the leader is allowed to delete a certain number of edges from the graph in order to maximally impede the follower, who is trying to solve an optimization problem on the impeded graph. We introduce approximation algorithms and strong NP-completeness results for interdiction problems on planar graphs. We give a multiplicative $(1 + ε)$-approximation for the maximum matching interdiction problem on weighted planar graphs. The algorithm runs in pseudo-polynomial time for each fixed $ε> 0$. We also show that weighted maximum matching interdiction, budget-constrained flow improvement, directed shortest path interdiction, and minimum perfect matching interdiction are strongly NP-complete on planar graphs. To our knowledge, our budget-constrained flow improvement result is the first planar NP-completeness proof that uses a one-vertex crossing gadget.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.1305.1407

Authors: Pan, Feng, Schild, Aaron

Institutions: Los Alamos National Laboratory, Princeton University

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funders: U.S. Department of Energy, U.S. Department of Homeland Security, Oak Ridge Associated Universities, Princeton University, Oak Ridge Institute for Science and Education, Los Alamos National Laboratory

Awards: G2639602320, G2988778103, G365113682, G491774827, G803281476, G857543222

OpenAlex ID: W2406190870

Cites:

Cited by:

Related to: 10