Submodular Function Maximization via the Multilinear Relaxation and Contention Resolution Schemes

We consider the problem of maximizing a nonnegative submodular set function $f:2 perpendicular \rightarrow {\mathbb R}_+$ over a ground set $N$ subject to a variety of packing-type constraints including (multiple) matroid constraints, knapsack constraints, and their intersections. In this paper we d...

Full description

Bibliographic Details

Published in:	SIAM journal on computing Vol. 43; no. 6; pp. 1831 - 1879
Main Authors:	Chekuri, Chandra, Vondrák, Jan, Zenklusen, Rico
Format:	Journal Article
Language:	English
Published:	01.01.2014
Subjects:	Algorithms Approximation Constants Intersections Mathematical analysis Mathematical models Maximization Polytopes
ISSN:	0097-5397, 1095-7111
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!