The One-Way Communication Complexity of Submodular Maximization with Applications to Streaming and Robustness

Summary

This is a publication. If there is no link to the publication on this page, you can try the pre-formated search via the search engines listed on this page.

Authors: Moran Feldman, Ashkan Norouzi-Fard, Ola Svensson, Rico Zenklusen

Journal title: Proceedings of the 52th ACM Symposium on Theory of Computing (STOC)

Journal publisher: ACM

Published year: 2020

Published pages: 1363-1374

DOI identifier: 10.1145/3357713.3384286

ISBN: 978-1-4503-6979-4