On the Complexity of the Geometric Median Problem with Outliers

12/01/2021
by   Vladimir Shenmaier, et al.
0

In the Geometric Median problem with outliers, we are given a finite set of points in d-dimensional real space and an integer m, the goal is to locate a new point in space (center) and choose m of the input points to minimize the sum of the Euclidean distances from the center to the chosen points. This problem can be solved "almost exactly" in polynomial time if d is fixed and admits an approximation scheme PTAS in high dimensions. However, the complexity of the problem was an open question. We prove that, if the dimension of space is not fixed, Geometric Median with outliers is strongly NP-hard, does not admit approximation schemes FPTAS unless P=NP, and is W[1]-hard with respect to the parameter m. The proof is done by a reduction from the Independent Set problem. Based on a similar reduction, we also get the NP-hardness of closely related geometric 2-clustering problems in which it is required to partition a given set of points into two balanced clusters minimizing the cost of median clustering. Finally, we study Geometric Median with outliers in ℓ_∞ space and prove the same complexity results as for the Euclidean problem.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/21/2019

On the hardness of computing an average curve

We study the complexity of clustering curves under k-median and k-center...
research
08/24/2021

Linear-Size Universal Discretization of Geometric Center-Based Problems in Fixed Dimensions

Many geometric optimization problems can be reduced to finding points in...
research
02/11/2023

Partial k-means to avoid outliers, mathematical programming formulations, complexity results

A well-known bottleneck of Min-Sum-of-Square Clustering (MSSC, the celeb...
research
06/04/2021

On the Strategyproofness of the Geometric Median

The geometric median of a tuple of vectors is the vector that minimizes ...
research
09/14/2023

Massively-Parallel Heat Map Sorting and Applications To Explainable Clustering

Given a set of points labeled with k labels, we introduce the heat map s...
research
02/14/2018

Median Shapes

We introduce and begin to explore the mean and median of finite sets of ...
research
10/03/2019

On Computing a Center Persistence Diagram

Given a set of persistence diagrams P_1,..., P_m, for the data reduction...

Please sign up or login with your details

Forgot password? Click here to reset