Jan Höckendorff

collaborators

2 papers

cs.DS2026

Near Linear Time Approximation Schemes for Clustering of Partially Doubling Metrics

Anne Driemel, Jan Höckendorff, Ioannis Psarros +2

Given a finite metric space $(X \cup Y, d)$ the $k$ -median problem is to find a set of $k$ centers $C \subseteq Y$ that minimizes $\sum_{p\in X} \min_{c\in C} \mathbf{d}(p,c…

cs.DS2024

A Subquadratic Time Approximation Algorithm for Individually Fair k-Center

Matthijs Ebbens, Nicole Funk, Jan Höckendorff +2

We study the $k$ -center problem in the context of individual fairness. Let $P$ be a set of $n$ points in a metric space and $r_{x}$ be the distance between $x \in P$ and its $\lceil…