The one-way communication complexity of submodular maximization with applications to streaming and robustness

@article{Feldman2020TheOC,
  title={The one-way communication complexity of submodular maximization with applications to streaming and robustness},
  author={M. Feldman and Ashkan Norouzi-Fard and O. Svensson and R. Zenklusen},
  journal={Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing},
  year={2020}
}
  • M. Feldman, Ashkan Norouzi-Fard, +1 author R. Zenklusen
  • Published 2020
  • Computer Science, Mathematics
  • Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing
  • 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 multi-player model that lies between the offline and streaming model, and study it under the aspect of one-way communication complexity. Our model captures the streaming setting (by considering a large number of players), and, in addition, two player… CONTINUE READING