An Exponential Speedup in Parallel Running Time for Submodular Maximization without Loss in Approximation

Eric Balkanski, Aviad Rubinstein, Yaron Singer. An Exponential Speedup in Parallel Running Time for Submodular Maximization without Loss in Approximation. 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 283-302, SIAM, 2019. [doi]

Abstract

Abstract is missing.