TY - JOUR AU - Liu, Qian AU - Yu, Kemin AU - Li, Min AU - Zhou, Yang PY - 2023 TI - k-Submodular Maximization with a Knapsack Constraint and p Matroid Constraints JO - Tsinghua Science and Technology SN - 1007-0214 SP - 896 EP - 905 VL - 28 IS - 5 AB - A k-submodular function is a generalization of a submodular function, its definition domain is extended from the collection of single subsets to the collection of k disjoint subsets. The k-submodular maximization problem has a wide range of applications. In this paper, we propose a nested greedy and local search algorithm for the problem of maximizing a monotone k-submodular function subject to a knapsack constraint and p matroid constraints. UR - https://doi.org/10.26599/TST.2022.9010039 DO - 10.26599/TST.2022.9010039