Author:
Pham Canh V.,Phu Quat V.,Ha Dung T. K.
Publisher
Springer Nature Singapore
Reference24 articles.
1. Badanidiyuru, A., Vondrák, J.: Fast algorithms for maximizing submodular functions. In: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1497–1514. SIAM (2014)
2. Blelloch, G.E., Peng, R., Tangwongsan, K.: Linear-work greedy parallel approximate set cover and variants. In: Proceedings of the 23rd ACMSPAA 2011, pp. 23–32. ACM (2011)
3. Chen, Y., Dey, T., Kuhnle, A.: Best of both worlds: practical and theoretically optimal submodular maximization in parallel. In: Neural Information Processing Systems (2021)
4. Crawford, V.: Scalable bicriteria algorithms for non-monotone submodular cover. In: International Conference on Artificial Intelligence and Statistics, pp. 9517–9537. PMLR (2023)
5. Crawford, V.G.: An efficient evolutionary algorithm for minimum cost submodular cover. In: Kraus, S. (ed.) Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, pp. 1227–1233. ijcai.org (2019)