Submodular Function Maximization via the Multilinear Relaxation and Contention Resolution Schemes

  title={Submodular Function Maximization via the Multilinear Relaxation and Contention Resolution Schemes},
  author={Chandra Chekuri and Jan Vondr{\'a}k and Rico Zenklusen},
We consider the problem of maximizing a non-negative submodular set function f:2N -> RR+ 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 develop a general framework that allows us to derive a number of new results, in particular when f may be a non-monotone function. Our algorithms are based on (approximately) solving the multilinear extension F of f [5] over a polytope… CONTINUE READING
Highly Influential
This paper has highly influenced 32 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 213 citations. REVIEW CITATIONS
130 Citations
9 References
Similar Papers


Publications citing this paper.

213 Citations

Citations per Year
Semantic Scholar estimates that this publication has 213 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-9 of 9 references

An analysis of approximations for maximizing submodular set functions - II

  • M. L. Fisher, G. L. Nemhauser, L. A. Wolsey
  • Math. Prog. Study, 8:73–87
  • 1978
Highly Influential
5 Excerpts

Location of bank accounts to optimize float: An analytic study of exact and approximate algorithms

  • G. Cornuejols, M. L. Fisher, G. Nemhauser
  • Management Science, 23:789–810
  • 1977
Highly Influential
5 Excerpts

Similar Papers

Loading similar papers…