The study of combinatorial optimization problems with submodular objectives has attracted much attention in recent years. Such problems are important in both theory and practice because their objective functions are very general. Obtaining further improvements for many submodular maximization problems boils down to finding better algorithms for optimizing a relaxation of them known as the multilinear extension. In this work, we present an algorithm for optimizing the multilinear relaxation whose guarantee improves over the guarantee of the best previous algorithm (by Ene and Nguyen). Moreover, our algorithm is based on a new technique that is, arguably, simpler and more natural for the problem at hand. In a nutshell, previous algorithms for this problem rely on symmetry properties that are natural only in the absence of a constraint. Our technique avoids the need to resort to such properties, and thus seems to be a better fit for constrained problems.
|Number of pages||18|
|Journal||Mathematics of Operations Research|
|State||Published - 2019|
Bibliographical noteFunding Information:
Funding: The work of N. Buchbinder was supported by the Israel Science Foundation [Grant 1585/15] and the United States–Israel Binational Science Foundation [Grant 2014414]. The work of M. Feldman was supported in part by the Israel Science Foundation [Grant 1357/16].
© 2019 INFORMS
- Approximation algorithm
- Multilinear relaxation
- Submodular maximization