1. Altschuler, J., Bhaskara, A., Fu, G., Mirrokni, V., Rostamizadeh, A., Zadimoghaddam, M.: Greedy column subset selection: new bounds and distributed algorithms. In: Proceedings of ICML, pp. 2539–2548 (2016)
2. Alon, N., Spencer, J.H.: The Probabilistic Method, vol. 3, pp. 307–314. Wiley, New York (2008)
3. Balkanski, E., Rubinstein, A., Singer, Y.: An optimal approximation for submodular maximization under a matroid constraint in the adaptive complexity model. In: Proceedings of STOC, pp. 66–77 (2019)
4. Bian, A.A., Buhmann, J.M., Krause, A., Tschiatschek, S.: Guarantees for greedy maximization of non-submodular functions with applications. In: Proceedings of ICML, pp. 498–507 (2017)
5. Buchbinder, N., Feldman, M., Garg, M.: Deterministic (1/2+$$\varepsilon $$)-approximation for submodular maximization over a matroid. In: Proceedings of SODA, pp. 241–254 (2019)