1. Amanatidis, G., Fusco, F., Lazos, P., Leonardi, S., Reiffenhäuser, R.: Fast adaptive non-monotone submodular maximization subject to a knapsack constraint. In: Proceedings of Annual Conference on Neural Information Processing Systems (2020)
2. Buchbinder, N., Feldman, M., Seffi, J., Schwartz, R.: A tight linear time (1/2)-approximation for unconstrained submodular maximization. SIAM J. Comput. 44(5), 1384–1402 (2015)
3. Crawford, V.: Scalable bicriteria algorithms for non-monotone submodular cover. In: Proceedings of The 26th International Conference on Artificial Intelligence and Statistics, pp. 9517–9537. PMLR (2023)
4. Crawford, V., Kuhnle, A., Thai, M.: Submodular cost submodular cover with an approximate oracle. In: Proceedings of the 36th International Conference on Machine Learning, pp. 1426–1435. PMLR (2019)
5. Crawford, V.G.: Faster guarantees of evolutionary algorithms for maximization of monotone submodular functions. In: Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, IJCAI 2021, Virtual Event / Montreal, Canada, 19–27 August 2021, pp. 1661–1667. ijcai.org (2021)