Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints

Abstract

Submodular function maximization is a central problem in combinatorial optimization, generalizing many important problems including Max Cut in directed/undirected graphs and in hypergraphs, certain constraint satisfaction problems, maximum entropy sampling, and maximum facility location problems. Unlike submodular minimization, submodular maximization is NP… (More)
DOI: 10.1137/090750020

Topics

5 Figures and Tables

Statistics

0102020082009201020112012201320142015201620172018
Citations per Year

84 Citations

Semantic Scholar estimates that this publication has 84 citations based on the available data.

See our FAQ for additional information.

Slides referencing similar topics