New Approximation Algorithms for Fair $k$-median Problem

Di Wu, Qilong Feng, Jianxin Wang

The fair $k$-median problem is one of the important clustering problems. The current best approximation ratio is 4.675 for this problem with 1-fair violation, which was proposed by…