Constrained submodular maximization via greedy local search

We present a simple combinatorial 1−e−22-approximation algorithm for maximizing a monotone submodular function subject to a knapsack and a matroid constraint. This classic problem is known to be hard to approximate within factor better than 1−1∕e. We extend the algorithm to yield 1−e−(k+1)k+1 approx...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Operations research letters Jg. 47; H. 1; S. 1 - 6
Hauptverfasser: Sarpatwar, Kanthi K., Schieber, Baruch, Shachnai, Hadas
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Elsevier B.V 01.01.2019
Schlagworte:
Knapsack
Matroid
Submodular functions
Submodular functions
Matroid
Knapsack
ISSN:0167-6377, 1872-7468
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We present a simple combinatorial 1−e−22-approximation algorithm for maximizing a monotone submodular function subject to a knapsack and a matroid constraint. This classic problem is known to be hard to approximate within factor better than 1−1∕e. We extend the algorithm to yield 1−e−(k+1)k+1 approximation for submodular maximization subject to a single knapsack and k matroid constraints, for any fixed k>1. Our algorithms, which combine the greedy algorithm of Khuller et al. (1999) and Sviridenko (2004) with local search, show the power of this natural framework in submodular maximization with combined constraints.
ISSN:0167-6377
1872-7468
DOI:10.1016/j.orl.2018.11.002