Vanilla fairlet. This is the approach proposed by Chierichetti et al. [1]}. The first phase computes a vanilla fairlet decomposition that ensures fair clusters, but it might not give the optimal cost value. A vanilla \(k\) -Center clustering algorithm [2]} is applied to cluster those fairlets into \(k\)  clusters in the second step.
