October 1, 2007

Maximizing Non-Monotone Submodular Functions

Puntos clave

Los puntos clave no están disponibles para este artículo en este momento.

Resumen

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.

Preguntar a la IA

Me gusta

Guardar

Cite This Study

Feige et al. (Mon,) studied this question.

synapsesocial.com/papers/6a21e95ce8ef4064f24e92e3 https://doi.org/https://doi.org/10.1109/focs.2007.29

Also Consider

Synapse has enriched 4 closely related papers on similar clinical questions. Consider them for comparative context:

1Approximating the value of two power proof systems, with applications to MAX 2SAT and MAX DICUT2002 · 332 citations
2Canonical decompositions of symmetric submodular systems1983 · 31 citations
3The maximization of submodular functions : old and new proofs for the correctness of the dichotomy algorithm1999 · 18 citations
4Hardness of Max 3SAT with No Mixed Clauses2005 · 20 citations

Preguntar a la IA

Me gusta

Guardar