Submodular Maximization with Nearly Optimal Approximation, Adaptivity and Query Complexity

Matthew Fahrbach, Vahab S. Mirrokni, Morteza Zadimoghaddam. Submodular Maximization with Nearly Optimal Approximation, Adaptivity and Query Complexity. In Timothy M. Chan, editor, Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, San Diego, California, USA, January 6-9, 2019. pages 255-273, SIAM, 2019. [doi]

Abstract

Abstract is missing.