Hung P. Hoang

Matrix Editing Meets Fair Clustering: Parameterized Algorithms and Complexity

We study the computational problem of computing a fair means clustering of discrete vectors, which admits an equivalent formulation as editing a colored matrix into one with few distinct color-balanced rows by changing at most k values. While NP-hard in both the fairness-oblivious and the fair setti