A brief note on approximate optimization of submodular functions
Abstract
We review some basics from submodular function maximization. We also detail the greedy method and a couple of its more efficient variants for approximately maximizing monotone submodular functions.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.