The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf
.
Matching Interdiction
[article]
2008
arXiv
pre-print
In the matching interdiction problem, we are given an undirected graph with weights and interdiction costs on the edges and seek to remove a subset of the edges constrained to some budget, such that the weight of a maximum weight matching in the remaining graph is minimized. In this work we introduce the matching interdiction problem and show that it is strongly NP-complete even when the input is restricted to simple, bipartite graphs with unit edge weights and unit interdiction costs.
arXiv:0804.3583v1
fatcat:y7rkc2ktkvd5rdgtnh46ppi4kq