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...

Full description

Bibliographic Details

Published in:	Operations research letters Vol. 47; no. 1; pp. 1 - 6
Main Authors:	Sarpatwar, Kanthi K., Schieber, Baruch, Shachnai, Hadas
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.01.2019
Subjects:	Knapsack Matroid Submodular functions Submodular functions Matroid Knapsack
ISSN:	0167-6377, 1872-7468
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!