DeepAI AI Chat
Log In Sign Up

A Constant Approximation for Colorful k-Center

by   Sayan Bandyapadhyay, et al.
The University of Iowa

In this paper, we consider the colorful k-center problem, which is a generalization of the well-known k-center problem. Here, we are given red and blue points in a metric space, and a coverage requirement for each color. The goal is to find the smallest radius ρ, such that with k balls of radius ρ, the desired number of points of each color can be covered. We obtain a constant approximation for this problem in the Euclidean plane. We obtain this result by combining a "pseudo-approximation" algorithm that works in any metric space, and an approximation algorithm that works for a special class of instances in the plane. The latter algorithm uses a novel connection to a certain matching problem in graphs.


page 1

page 2

page 3

page 4


Fair Colorful k-Center Clustering

An instance of colorful k-center consists of points in a metric space th...

Improved Algorithms for the Bichromatic Two-Center Problem for Pairs of Points

We consider a bichromatic two-center problem for pairs of points. Given ...

Computing Euclidean k-Center over Sliding Windows

In the Euclidean k-center problem in sliding window model, input points ...

On Perturbation Resilience of Non-Uniform k-Center

The Non-Uniform k-center (NUkC) problem has recently been formulated by ...

Towards Non-Uniform k-Center with Constant Types of Radii

In the Non-Uniform k-Center problem we need to cover a finite metric spa...

Non-Uniform k-Center and Greedy Clustering

In the Non-Uniform k-Center problem, a generalization of the famous k-ce...

Unsplittable Euclidean Capacitated Vehicle Routing: A (2+ε)-Approximation Algorithm

In the unsplittable capacitated vehicle routing problem, we are given a ...