16 citations · 18 across the 5 of their papers we have counts for
Showing cs.LGShow all
3 papers · 1 filter
cs.LG2021★ 16 cited
A Bi-Level Framework for Learning to Solve Combinatorial Optimization on Graphs
Runzhong Wang, Zhigang Hua, Gan Liu +6
Combinatorial Optimization (CO) has been a long-standing challenging research topic featured by its NP-hard nature. Traditionally such problems are approximately solved with heuris…
cs.LG2021★ 1 cited
Learning to Schedule DAG Tasks
Zhigang Hua, Feng Qi, Gan Liu +1
Scheduling computational tasks represented by directed acyclic graphs (DAGs) is challenging because of its complexity. Conventional scheduling algorithms rely heavily on simple heu…
cs.LG2020
Variational Optimization for the Submodular Maximum Coverage Problem
Jian Du, Zhigang Hua, Shuang Yang
We examine the \emph{submodular maximum coverage problem} (SMCP), which is related to a wide range of applications. We provide the first variational approximation for this problem…