1. Buchbinder, N., Feldman, M., Naor, J., Schwartz, R.: Submodular maximization with cardinality constraints. In: Chekuri, C. (ed.) Proceedings of the 2014 Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1433–1452. Society for Industrial and Applied Mathematics, Philadelphia, PA (2014)
2. Lin, H., Bilmes, J.: A class of submodular functions for document summarization. In: Lin, D., Matsumoto, Y., Mihalcea, R. (eds.) The 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies, pp. 510–520. Association for Computer Linguistics, New York (2011)
3. Hartline, J., Mirrokni, V., Sundararajan, M.: Optimal marketing strategies over social networks. In: Huai, J., Chen, R., Hon, H.W. (eds.) Proceedings of the 17th International Conference on World Wide Web, pp. 189–198. Association for Computing Machinery, New York, (2008)
4. Kazemi, E., Minaee, S., Feldman, M., Karbasi, A.: Regularized submodular maximization at scale. In: Meila, M., Zhang, T. (eds.) Proceedings of the 38th International Conference on Machine Learning, vol. 139, pp. 5356–5366. PMLR, New York (2021)
5. Papadimitriou, C.H., Yannakakis, M.: Optimization, approximation, and complexity classes. J. Comput. Syst. Sci. 43(3), 425–440 (1991)