A dynamic ridesharing system is a platform that connects drivers who use their personal
vehicles to travel with riders who are in need of transportation, on a short notice. Since each …

Fair clustering is a constrained clustering problem where we need to partition a set of
colored points. The fraction of points of each color in every cluster should be more or less …

We study the complexity of the classic capacitated k-median and k-means problems
parameterized by the number of centers, k. These problems are notoriously difficult since the …

Clustering with capacity constraints is a fundamental problem that attracted significant
attention throughout the years. In this paper, we give the first FPT constant-factor …

Capacitated k-median is one of the few outstanding optimization problems for which the
existence of a polynomial time constant factor approximation algorithm remains an open …

We study the Capacitated k-Median problem for which existing constant-factor
approximation algorithms are all pseudo-approximations that violate either the capacities or …

In the classical k-median problem the goal is to select a subset of at most k facilities in order
to minimize the total cost of opened facilities and established connections between clients …

We consider the classic uniform capacitated k-median and uniform capacitated k-means
problems in bounded doubling metrics. We provide the first QPTAS for both problems and …

The Metric $ k $-median problem over a metric space $(\mathcal {X}, d) $ is defined as
follows: given a set $ L\subseteq\mathcal {X} $ of facility locations and a set …

In sum of radii clustering, the input consists of a finite set of points in a metric space. The
problem asks to place a set of k balls centered at a subset of the points such that every point …