Red blue k-center clustering with distance constraints

07/26/2021
by   M. Eskandari, et al.
0

We consider a variant of the k-center clustering problem in ^d, where the centers can be divided into two subsets, one, the red centers of size p, and the other, the blue centers of size q, where p+q=k, and such that each red center and each blue center must be apart a distance of at least some given α≥ 0, with the aim of minimizing the covering radius. We provide a bi-criteria approximation algorithm for the problem and a polynomial time algorithm for the constrained problem where all centers must lie on a given line ℓ.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/16/2021

Separated Red Blue Center Clustering

We study a generalization of k-center clustering, first introduced by Ka...
research
02/07/2018

Privacy preserving clustering with constraints

The k-center problem is a classical combinatorial optimization problem w...
research
09/27/2021

Clustering with Neighborhoods

In the standard planar k-center clustering problem, one is given a set P...
research
05/06/2018

Generalized Center Problems with Outliers

We study the F-center problem with outliers: given a metric space (X,d),...
research
07/08/2020

Fair Colorful k-Center Clustering

An instance of colorful k-center consists of points in a metric space th...
research
10/04/2019

Developing Biomarker Combinations in Multicenter Studies via Direct Maximization and Penalization

Motivated by a study of acute kidney injury, we consider the setting of ...
research
04/19/2022

An Efficient Algorithm for the Proximity Connected Two Center Problem

Given a set P of n points in the plane, the k-center problem is to find ...

Please sign up or login with your details

Forgot password? Click here to reset