SOURCE-LINKED INTELLIGENCE

Parameterized and Streaming Algorithms for Euclidean Fair $k$-Center Clustering

arXiv · AI, language, vision and robotics · article · Sep 6, 2026 · UTC

Motivated by the growing importance of fairness in machine learning, fair $k$-center clustering has attracted considerable research attention as a fundamental problem. In this problem, a dataset is partitioned into $m$ disjoint groups, and the objective is to select $k$ data points as centers, subject to upper bounds on the number of centers chosen from each group, aiming to minimize the maximum distance between any data point and its assigned center. Focusing on Euclidean spaces, which are ubiquitous in machine learning applications, we first develop a parameterized approximation algorithm fo

Read original source ↗ Open in workspace

recordType

paper

region

Global