Robust Approximation Algorithms for Non-monotone $k$-Submodular Maximization under a Knapsack Constraint

Dung T. K. Ha, Canh V. Pham, Tan D. Tran +1

The problem of non-monotone $k$-submodular maximization under a knapsack constraint ($\kSMK$) over the ground set size $n$ has been raised in many applications in machine learning,…