1. Badanidiyuru, A., Mirzasoleiman, B., Karbasi, A., Krause, A.: Streaming submodular maximization: massive data summarization on the fly. In: The Proceedings of the Twentieth International Conference on Knowledge Discovery and Data Mining, pp. 671–680. ACM Press, New York (2014)
2. Breuer, A., Balkanski, E., Singer, Y.: The FAST algorithm for submodular maximization. In: The Proceedings of the Thirty-Seventh International Conference on Machine Learning, pp. 1134–1143. PMLR Press, Virtual Event (2020)
3. Chekuri, C., Quanrud, K.: Parallelizing greedy for submodular set function maximization in matroids and beyond. In: The Proceedings of the Fifty-First Annual ACM SIGACT Symposium on Theory of Computing, pp. 78–89. ACM Press, Phoenix (2019)
4. Ene, A., Nguyen, H. L., Vladu, A.: A parallel double greedy algorithm for submodular maximization (2018). arXiv:1812.01591
5. Ene, A., Nguyen, H. L.: A Nearly-Linear Time Algorithm for Submodular Maximization with a Knapsack Constraint. In: The Proceedings of the Forty-Sixth International Colloquium on Automata, Languages, and Programming, pp. 53:1–53:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik Press, Patras (2019)