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

• Published in: Journal of the ACM Vol. 70; no. 4; pp. 1 - 52
• Main Authors: Feldman, Moran, Norouzi-Fard, Ashkan, Svensson, Ola, Zenklusen, Rico
• Format: Journal Article
• Language: English
• Published: New York, NY ACM 12.08.2023; Association for Computing Machinery
• Subjects: Algorithms; Approximation; Approximation algorithms analysis; Communication; Communication complexity; Complexity; Data transmission; Hardness; Information theory; Mathematical analysis; Maximization; Optimization; Players; Problems, reductions and completeness; Robustness; Theory of computation; robustness; streaming; Communication complexity; submodular maximization; approximation algorithms
• ISSN: 0004-5411; 1557-735X
• DOI: 10.1145/3588564

We consider the classical problem of maximizing a monotone submodular function subject to a cardinality constraint, which, due to its numerous applications, has recently been studied in various computational models. We consider a clean multiplayer model that lies between the offline and streaming mo...