1 citations · 2 across the 4 of their papers we have counts for
5 papers
A Combinatorial -Approximation for -Submodular Maximization under Multiple Knapsacks
Siyuan Chen, Suixiang Gao, Zheyu Jiang +1
We give a randomized combinatorial \((1/2 - \varepsilon)\)-approximation for nonnegative non-monotone \(k\)-submodular maximization under a fixed number \(d\) of knapsack constrain…
Wide & Deep Learning for Node Classification
Yancheng Chen, Wenguo Yang, Zhipeng Jiang
Wide & Deep, a simple yet effective learning architecture for recommendation systems developed by Google, has had a significant impact in both academia and industry due to its comb…
Continuous Non-monotone DR-submodular Maximization with Down-closed Convex Constraint
Shengminjie Chen, Donglei Du, Wenguo Yang +2
We investigate the continuous non-monotone DR-submodular maximization problem subject to a down-closed convex solvable constraint. Our first contribution is to construct an example…
Regularized Non-monotone Submodular Maximization
Cheng Lu, Wenguo Yang, Suixiang Gao
In this paper, we present a thorough study of maximizing a regularized non-monotone submodular function subject to various constraints, i.e., $\max \{ g(A) - \ell(A) : A \in \mathc…
Approximating Soft-Capacitated Facility Location Problem With Uncertainty
Shuxin Cai, Wenguo Yang, Yaohua Tang
We first show that a better analysis of the algorithm for The Two-Sage Stochastic Facility Location Problem from Srinivasan \cite{sri07} and the algorithm for The Robust Fault Tole…