Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Interdiction Problems on Planar Graphs   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 + \epsilon)$-approximation for the maximum matching
interdiction problem on weighted planar graphs. The algorithm runs in
pseudo-polynomial time for each fixed $\epsilon > 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.

14
The categories of this paper are: math-ph
21
The categories of this paper are: adap-org
5
The categories of this paper are: gr-qc
35
The categories of this paper are: mtrl-th
6
The categories of this paper are: astro-ph
26
The categories of this paper are: bayes-an
31
The categories of this paper are: ao-sci
10
The categories of this paper are: q-bio
33
The categories of this paper are: plasm-ph
20
The categories of this paper are: acc-phys
37
The categories of this paper are: supr-con
16
The categories of this paper are: stat
29
The categories of this paper are: funct-an
24
The categories of this paper are: dg-ga
36
The categories of this paper are: cmp-lg
25
The categories of this paper are: patt-sol