Approximations for Monotone and Nonmonotone Submodular Maximization with Knapsack Constraints

Submodular maximization generalizes many fundamental problems in discrete optimization, including Max-Cut in directed/undirected graphs, maximum coverage, maximum facility location, and marketing over social networks. In this paper we consider the problem of maximizing any submodular function subjec...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Mathematics of operations research 2013-11, Vol.38 (4), p.729-739
Hauptverfasser:	Kulik, Ariel, Shachnai, Hadas, Tamir, Tami
Format:	Artikel
Sprache:	eng
Schlagworte:	Analysis approximation algorithms Approximations Expectation-maximization algorithm generalized assignment problem knapsack constraints Knapsack problem Mathematical functions maximum coverage Optimization techniques Polynomials randomization Studies submodular maximization
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!