MCF fairlet. In this version [1]}, the fairlet decomposition is transformed into a minimum cost flow (MCF) problem, by which an optimized version of fairlet decomposition in terms of cost value is computed. Like the vanilla version, a \(k\) -Center method is used to cluster fairlets in the second phase.
