research
∙
03/28/2022
An improved approximation algorithm for maximizing a DR-submodular function over a convex set
Maximizing a DR-submodular function subject to a general convex set is a...
share
research
∙
03/15/2022
Maximizing Modular plus Non-monotone Submodular Functions
The research problem in this work is the relaxation of maximizing non-ne...
research
∙
12/20/2020
Outliers Detection Is Not So Hard: Approximation Algorithms for Robust Clustering Problems Using Local Search Techniques
In this paper, we consider two types of robust models of the k-median/k-...
research
∙
09/16/2020
Too Much Information Kills Information: A Clustering Perspective
Clustering is one of the most fundamental tools in the artificial intell...
research
∙
01/08/2020
