Search Results for author:
Found 2 papers, 0 papers with code
A Polynomial-Time Approximation for Pairwise Fair $k$-Median Clustering
In this work, we study pairwise fair clustering with $\ell \ge 2$ groups, where for every cluster $C$ and every group $i \in [\ell]$, the number of points in $C$ from group $i$ must be at most $t$ times the number of points in $C$ from any other group $j \in [\ell]$, for a given integer $t$.
Approximating Fair Clustering with Cascaded Norm Objectives
We utilize convex programming techniques to approximate the $(p, q)$-Fair Clustering problem for different values of $p$ and $q$.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
