An Exponential Speedup in Parallel Running Time for Submodular Maximization without Loss in Approximation - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Eric Balkanski' in GoogleThis author has not been identified. Look up 'Aviad Rubinstein' in GoogleThis author has not been identified. Look up 'Yaron Singer' in Google

runs on WebDSL