A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf
.
Approximations for Monotone and Nonmonotone Submodular Maximization with Knapsack Constraints
2013
Mathematics of Operations Research
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 subject to d knapsack constraints, where d is a fixed constant. We establish a strong relation between the discrete problem and its continuous relaxation, obtained through extension by expectation of the
doi:10.1287/moor.2013.0592
fatcat:calt4f635zaehn37pduhxsl4ce