Papers › A Scalable Algorithm for Individually Fair K-means Clustering
A Scalable Algorithm for Individually Fair K-means Clustering
Mohammadhossein Bateni, Vincent Cohen-Addad, Alessandro Epasto, Silvio Lattanzi
We present a scalable algorithm for the individually fair (p, k)-clustering problem introduced by Jung et al. and Mahabadi et al. Given n points P in a metric space, let δ(x) for x∈P be the radius of the smallest ball around x containing at least n / k points. A clustering is then called individually fair if it has centers within distance δ(x) of x for each x∈P. While good approximation algorithms are known for this problem no efficient practical algorithms with good theoretical guarantees have been presented. We design the first fast local-search algorithm that runs in ~O(nk²) time and obtains a bicriteria (O(1), 6) approximation. Then we show empirically that not only is our algorithm much faster than prior work, but it also produces lower-cost solutions.
In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Tasks
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections