Skip to content

Author

Shengminjie Chen

We have 4 of 20 papers

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 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 Oct 2026

When Weak Submodularity Meets Matroids: How Does Standard Greedy Behave?

Weakly submodular maximization finds numerous applications in machine learning, data mining and statistics. In particular, under a cardinality constraint, the standard greedy algorithm is known to attain the tight $(1-e^{-\gamma})$-approximation guarantee, where $\gamma$ denotes the submodularity ratio. However, when c...

Qi-Xin Zhang, Shi Fu, Shengminjie Chen 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.