On maximizing a monotone k-submodular function under a knapsack constraint

We study the problem of maximizing a non-negative monotone k-submodular function f under knapsack constraint, where is natural generalization submodular to k dimensions. present deterministic (12?12e)-approximation algorithm that evaluates O(n4k3) times, based on result Sviridenko (2004) maximization.