We give a randomized combinatorial \((1/2 - \varepsilon)\)-approximation for nonnegative non-monotone \(k\)-submodular maximization under a fixed number \(d\) of knapsack constraints, for \(k \ge 2 \). The algorithm selects whole elements and follows the proportional top-2 rule of Chen et al. \cite{chen2026}: it sample...
Si-Yuan Chen, Sui-Xiang Gao, Zhe-Yu Jiang et al.· 0 citations
It is proved that the generalized maximum flow over time problem remains NP-hard under standard binary encoding, even on lossy two-terminal series-parallel networks, and it is proved that an optimal solution always exists without intermediate storage.
Si-Yuan Chen, Shengminjie Chen, Sui-Xiang Gao et al.· 0 citations
$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...
Si-Yuan Chen, Shengminjie Chen, Sui-Xiang Gao et al.· 0 citations
These results give the first approximation guarantees exceeding $1/3$ for non-monotone $k$-submodular maximization under matroid and knapsack constraints under classical support constraints.
Si-Yuan Chen, Shengminjie Chen, Sui-Xiang Gao et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.