eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Leibniz International Proceedings in Informatics
1868-8969
2017-08-11
9:1
9:19
10.4230/LIPIcs.APPROX-RANDOM.2017.9
article
Symmetric Interdiction for Matching Problems
Haney, Samuel
Maggs, Bruce
Maiti, Biswaroop
Panigrahi, Debmalya
Rajaraman, Rajmohan
Sundaram, Ravi
Motivated by denial-of-service network attacks, we introduce the symmetric interdiction model, where both the interdictor and the optimizer are subject to the same constraints of the underlying optimization problem. We give a general framework that relates optimization to symmetric interdiction for a broad class of optimization problems. We then study the symmetric matching interdiction problem - with applications in traffic engineering - in more detail. This problem can be simply stated as follows: find a matching whose removal minimizes the size of the maximum matching in the remaining graph. We show that this problem is APX-hard, and obtain a 3/2-approximation algorithm that improves on the approximation guarantee provided by the general framework.
https://drops.dagstuhl.de/storage/00lipics/lipics-vol081-approx-random2017/LIPIcs.APPROX-RANDOM.2017.9/LIPIcs.APPROX-RANDOM.2017.9.pdf
Approximation algorithms
matching
interdiction Digital Object