Parameterized and Streaming Algorithms for Euclidean Fair $k$-Center Clustering
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…
We haven't written up this one. arXiv cs.AI has the full story — the link below goes straight to it.