9 citations · 22 across the 13 of their papers we have counts for
6 papers · 1 filter
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…
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…
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…
Approximate the individually fair k-center with outliers
Lu Han, Dachuan Xu, Yicheng Xu +1
In this paper, we propose and investigate the individually fair -center with outliers (IFCO). In the IFCO, we are given an -sized vertex set in a metric space, as well…
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…
An improved approximation algorithm for k-median problem using a new factor-revealing LP
Chenchen Wu, Dachuan Xu, Donglei Du +1
The k-median problem is a well-known strongly NP-hard combinatorial optimization problem of both theoretical and practical significance. The previous best approximation ratio for t…