Breaking the 1/3 Barrier for constrained $\boldsymbol{k}$-Submodular Maximization: A Proportional Top-2 Randomized Framework
$k$-submodularity generalizes submodularity by allowing each selected element to be assigned one of $k$ labels. We study the maximization of a non-monotone $k$-submodular function, where $k\ge2$, under matroid and knapsack constraints. We develop a proportional top-2 randomized framework that achieves an approximation...