3 citations · 6 across the 8 of their papers we have counts for
Showing 2022Show all
3 papers · 1 filter
math.OC2022
Parallel algorithms for maximizing one-sided -smooth function
Hongxiang Zhang, Yukun Cheng, Chenchen Wu +2
In this paper, we study the problem of maximizing a monotone normalized one-sided -smooth ( for short) function , subject to a convex polytope. This problem was first…
cs.DS2022
Maximizing Modular plus Non-monotone Submodular Functions
Xin Sun, Chenchen Wu, Dachuan Xu +1
The research problem in this work is the relaxation of maximizing non-negative submodular plus modular with the entire real number domain as its value range over a family of down-c…
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…