Generalized Center Problems with Outliers

05/06/2018
by   Deeparnab Chakrabarty, et al.
0

We study the F-center problem with outliers: given a metric space (X,d), a general down-closed family F of subsets of X, and a parameter m, we need to locate a subset S∈F of centers such that the maximum distance among the closest m points in X to S is minimized. Our main result is a dichotomy theorem. Colloquially, we prove that there is an efficient 3-approximation for the F-center problem with outliers if and only if we can efficiently optimize a poly-bounded linear function over F subject to a partition constraint. One concrete upshot of our result is a polynomial time 3-approximation for the knapsack center problem with outliers for which no (true) approximation algorithm was known.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/08/2023

A 2-Approximation Algorithm for Data-Distributed Metric k-Center

In a metric space, a set of point sets of roughly the same size and an i...
research
01/13/2022

Approximate the individually fair k-center with outliers

In this paper, we propose and investigate the individually fair k-center...
research
02/18/2020

Coreset-based Strategies for Robust Center-type Problems

Given a dataset V of points from some metric space, the popular k-center...
research
02/16/2022

Distributed k-Means with Outliers in General Metrics

Center-based clustering is a pivotal primitive for unsupervised learning...
research
09/01/2022

Generalized k-Center: Distinguishing Doubling and Highway Dimension

We consider generalizations of the k-Center problem in graphs of low dou...
research
10/15/2018

Small Space Stream Summary for Matroid Center

In the matroid center problem, which generalizes the k-center problem, w...
research
07/26/2021

Red blue k-center clustering with distance constraints

We consider a variant of the k-center clustering problem in ^d, where th...

Please sign up or login with your details

Forgot password? Click here to reset