A tight approximation for submodular maximization with mixed packing and covering constraints

Eyal Mizrachi, Roy Schwartz, Joachim Spoerhase, Sumedha Uniyal

Tutkimustuotos: Artikkeli kirjassa/konferenssijulkaisussaConference contributionScientificvertaisarvioitu

25 Lataukset (Pure)


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 ε > 0 achieves a guarantee of 1 − 1/e − ε while violating only the covering constraints by a multiplicative factor of 1 − ε. 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.

Otsikko46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)
ToimittajatIoannis Chatzigiannakis, Christel Baier, Stefano Leonardi, Paola Flocchini
KustantajaSchloss Dagstuhl-Leibniz-Zentrum für Informatik
ISBN (elektroninen)9783959771092
DOI - pysyväislinkit
TilaJulkaistu - 1 heinäk. 2019
OKM-julkaisutyyppiA4 Artikkeli konferenssijulkaisuussa
TapahtumaInternational Colloquium on Automata, Languages and Programming - Patras, Kreikka
Kesto: 8 heinäk. 201912 heinäk. 2019
Konferenssinumero: 46


NimiLeibniz international proceedings in informatics
KustantajaSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISSN (painettu)1868-8969


ConferenceInternational Colloquium on Automata, Languages and Programming


Sukella tutkimusaiheisiin 'A tight approximation for submodular maximization with mixed packing and covering constraints'. Ne muodostavat yhdessä ainutlaatuisen sormenjäljen.

Siteeraa tätä