@article{Liu2023, 
author = {Qian Liu and Kemin Yu and Min Li and Yang Zhou},
title = {k-Submodular Maximization with a Knapsack Constraint and p Matroid Constraints},
year = {2023},
journal = {Tsinghua Science and Technology},
volume = {28},
number = {5},
pages = {896-905},
keywords = {approximation algorithm, k-submodularity, knapsack constraint, matroid constraint},
url = {https://www.sciopen.com/article/10.26599/TST.2022.9010039},
doi = {10.26599/TST.2022.9010039},
abstract = {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.}
}