Parameterized and Streaming Algorithms for Euclidean Fair k-Center Clustering
This work develops a parameterized approximation algorithm for Euclidean fair k-center clustering with an approximation ratio of 4.732 and designs a one-pass streaming algorithm with an approximation ratio of 4.42, outperforming the state-of-the-art ratio.
Ze-Yu Lin, Chaoqi Jia, Long-Kun Guo et al.
· Proceedings of the Thirty-Fi... · 0 citations