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

Citation:

Eric Balkanski, Aviad Rubinstein, and Yaron Singer. 2019. “An Exponential Speedup in Parallel Running Time for Submodular Maximization without Loss in Approximation.” In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA) 2019 . Download

See also: Balkanski, Eric, Rubinstein, Aviad, Singer, Yaron, 2019

Last updated on 10/12/2018

Copyright © 2024 The President and Fellows of Harvard College | Accessibility | Digital Accessibility | Report Copyright Infringement