License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.APPROX-RANDOM.2017.9
URN: urn:nbn:de:0030-drops-75587
URL: http://drops.dagstuhl.de/opus/volltexte/2017/7558/
Go to the corresponding LIPIcs Volume Portal


Haney, Samuel ; Maggs, Bruce ; Maiti, Biswaroop ; Panigrahi, Debmalya ; Rajaraman, Rajmohan ; Sundaram, Ravi

Symmetric Interdiction for Matching Problems

pdf-format:
LIPIcs-APPROX-RANDOM-2017-9.pdf (0.7 MB)


Abstract

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.

BibTeX - Entry

@InProceedings{haney_et_al:LIPIcs:2017:7558,
  author =	{Samuel Haney and Bruce Maggs and Biswaroop Maiti and Debmalya Panigrahi and Rajmohan Rajaraman and Ravi Sundaram},
  title =	{{Symmetric Interdiction for Matching Problems}},
  booktitle =	{Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2017)},
  pages =	{9:1--9:19},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-044-6},
  ISSN =	{1868-8969},
  year =	{2017},
  volume =	{81},
  editor =	{Klaus Jansen and Jos{\'e} D. P. Rolim and David Williamson and Santosh S. Vempala},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2017/7558},
  URN =		{urn:nbn:de:0030-drops-75587},
  doi =		{10.4230/LIPIcs.APPROX-RANDOM.2017.9},
  annote =	{Keywords: Approximation algorithms, matching, interdiction Digital Object}
}

Keywords: Approximation algorithms, matching, interdiction Digital Object
Seminar: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2017)
Issue Date: 2017
Date of publication: 31.07.2017


DROPS-Home | Fulltext Search | Imprint Published by LZI