2 citations · 3 across the 5 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
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…
cs.DS2020
Outliers Detection Is Not So Hard: Approximation Algorithms for Robust Clustering Problems Using Local Search Techniques
Yishui Wang, Rolf H. Möhring, Chenchen Wu +2
In this paper, we consider two types of robust models of the -median/-means problems: the outlier-version (-MedO/-MeaO) and the penalty-version (-MedP/-MeaP), in…