Submodular Optimization: Diminishing Returns, the (1-1/e) Greedy Guarantee, and Machine Learning ApplicationsA comprehensive study of submodular functions—the discrete analog of convexity—the greedy algorithm's optimal approximation, and applications in active learning and summarization.
