Maximizing Non-Monotone Submodular Functions

2007; Institute of Electrical and Electronics Engineers; Linguagem: Inglês

10.1109/focs.2007.4389516

ISSN

0272-5428

Autores

Uriel Feige, Vahab Mirrokni, J. Vondrák,

Tópico(s)

RFID technology advancements

Resumo

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.

Referência(s)