Submodular maximization generalizes many important problems including Max Cut in directed/undirected graphs and hypergraphs, certain constraint satisfaction problems and maximum facility location problems. Unlike the problem of minimizing submodular functions, the problem of maximizing submodular functions is NP-hard.
No takes yet. Share an insight, caveat, or question.
Feige et al. (2007) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: