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

Open in new window