[1]
Kuhnle, A. 2021. Nearly Linear-Time, Parallelizable Algorithms for Non-Monotone Submodular Maximization. Proceedings of the AAAI Conference on Artificial Intelligence. 35, 9 (May 2021), 8200-8208. DOI:https://doi.org/10.1609/aaai.v35i9.16998.