Publisher
Springer Nature Switzerland
Reference32 articles.
1. Badanidiyuru, A., Mirzasoleiman, B., Karbasi, A., Krause, A.: Streaming submodular maximization: massive data summarization on the fly. In: 20th International Proceedings on KDD, pp. 671–680. ACM, New York, NY, USA (2014)
2. Badanidiyuru, A., Vondrák, J.: Fast algorithms for maximizing submodular functions. In: 25th International Proceedings on SODA, pp. 1497–1514. SIAM, Portland, Oregon, USA (2014)
3. Buchbinder, N., Feldman, M., Schwartz, R.: Online submodular maximization with preemption. ACM Trans. Algorithms 15(3), 1–31 (2015)
4. Ene, A., Nguyen, H.L.: Streaming algorithm for monotone $$k$$-submodular maximization with cardinality constraints. In: 39th International Proceedings on ICML, pp. 5944–5967. PMLR, Baltimore, Maryland, USA (2022)
5. Fisher, M.L., Nemhauser, G.L., Wolsey, L.A.: An analysis of approximations for maximizing submodular set functions - II. In: Balinski, M.L., Hoffman, A.J. (eds.) Polyhedral Combinatorics. Mathematical Programming Studies, vol. 8. Springer, Berlin, Heidelberg (1978). https://doi.org/10.1007/BFb0121195