2 citations · 2 across the 2 of their papers we have counts for
2 papers
cs.DS2022★ 2 cited
An improved approximation algorithm for maximizing a DR-submodular function over a convex set
Donglei Du, Zhicheng Liu, Chenchen Wu +2
Maximizing a DR-submodular function subject to a general convex set is an NP-hard problem arising from many applications in combinatorial optimization and machine learning. While i…
cs.DS2020
Approximation algorithms for general cluster routing problem
Xiaoyan Zhang, Donglei Du, Gregory Gutin +2
Graph routing problems have been investigated extensively in operations research, computer science and engineering due to their ubiquity and vast applications. In this paper, we st…