Submodular Optimization Problems and Greedy Strategies: A Survey
Abstract
The greedy strategy is an approximation algorithm to solve optimization problems arising in decision making with multiple actions. How good is the greedy strategy compared to the optimal solution? In this survey, we mainly consider two classes of optimization problems where the objective function is submodular. The first is set submodular optimization, which is to choose a set of actions to optimize a set submodular objective function, and the second is string submodular optimization, which is to choose an ordered set of actions to optimize a string submodular function. Our emphasis here is on performance bounds for the greedy strategy in submodular optimization problems. Specifically, we review performance bounds for the greedy strategy, more general and improved bounds in terms of curvature, performance bounds for the batched greedy strategy, and performance bounds for Nash equilibria.
Cite
@article{arxiv.1905.03308,
title = {Submodular Optimization Problems and Greedy Strategies: A Survey},
author = {Yajing Liu and Edwin K. P. Chong and Ali Pezeshki and Zhenliang Zhang},
journal= {arXiv preprint arXiv:1905.03308},
year = {2019}
}