Skip to content

Author

Zhe-Yu Jiang

4 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Oct 2026

A Combinatorial $(1/2-\varepsilon)$-Approximation for $k$-Submodular Maximization under Multiple Knapsacks

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
Preprint Nov 2026

Generalized Flows over Time: Complexity, Structure and Algorithm

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
Preprint Sep 2026

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...

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.