1 Search Results for "Mizrachi, Eyal"


Document
Track A: Algorithms, Complexity and Games
A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints

Authors: Eyal Mizrachi, Roy Schwartz, Joachim Spoerhase, and Sumedha Uniyal

Published in: LIPIcs, Volume 132, 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)


Abstract
Motivated by applications in machine learning, such as subset selection and data summarization, we consider the problem of maximizing a monotone submodular function subject to mixed packing and covering constraints. We present a tight approximation algorithm that for any constant epsilon >0 achieves a guarantee of 1-(1/e)-epsilon while violating only the covering constraints by a multiplicative factor of 1-epsilon. Our algorithm is based on a novel enumeration method, which unlike previously known enumeration techniques, can handle both packing and covering constraints. We extend the above main result by additionally handling a matroid independence constraint as well as finding (approximate) pareto set optimal solutions when multiple submodular objectives are present. Finally, we propose a novel and purely combinatorial dynamic programming approach. While this approach does not give tight bounds it yields deterministic and in some special cases also considerably faster algorithms. For example, for the well-studied special case of only packing constraints (Kulik et al. [Math. Oper. Res. `13] and Chekuri et al. [FOCS `10]), we are able to present the first deterministic non-trivial approximation algorithm. We believe our new combinatorial approach might be of independent interest.

Cite as

Eyal Mizrachi, Roy Schwartz, Joachim Spoerhase, and Sumedha Uniyal. A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints. In 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 132, pp. 85:1-85:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)


Copy BibTex To Clipboard

@InProceedings{mizrachi_et_al:LIPIcs.ICALP.2019.85,
  author =	{Mizrachi, Eyal and Schwartz, Roy and Spoerhase, Joachim and Uniyal, Sumedha},
  title =	{{A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints}},
  booktitle =	{46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
  pages =	{85:1--85:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-109-2},
  ISSN =	{1868-8969},
  year =	{2019},
  volume =	{132},
  editor =	{Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.85},
  URN =		{urn:nbn:de:0030-drops-106610},
  doi =		{10.4230/LIPIcs.ICALP.2019.85},
  annote =	{Keywords: submodular function, approximation algorithm, covering, packing}
}
  • Refine by Author
  • 1 Mizrachi, Eyal
  • 1 Schwartz, Roy
  • 1 Spoerhase, Joachim
  • 1 Uniyal, Sumedha

  • Refine by Classification
  • 1 Theory of computation → Approximation algorithms analysis
  • 1 Theory of computation → Submodular optimization and polymatroids

  • Refine by Keyword
  • 1 approximation algorithm
  • 1 covering
  • 1 packing
  • 1 submodular function

  • Refine by Type
  • 1 document

  • Refine by Publication Year
  • 1 2019