1. Cohen, R., Katzir, L.: The generalized maximum coverage problem. Inf. Process. Lett. 108(1), 15–22 (2008)
2. Ene, A., Nguyen, H.L.: A nearly-linear time algorithm for submodular maximization with a knapsack constraint. In: Proceedings of the 46th International Colloquium on Automata, Languages, and Programming (ICALP) (2019)
3. Feldman, M., Nutov, Z., Shoham, E.: Practical budgeted submodular maximization. arXiv preprint arXiv:2007.04937 (2020)
4. Gridchyn, I., Kolmogorov, V.: Potts model, parametric maxflow and $$k$$-submodular functions. In: Proceedings of the IEEE International Conference on Computer Vision (ICCV), pp. 2320–2327 (2013)
5. Hirai, H., Iwamasa, Y.: On $$k$$-submodular relaxation. SIAM J. Discret. Math. 30(3), 1726–1736 (2016)