Better Algorithms for Individually Fair $k$ -Clustering

23 June 2021

Papers citing "Better Algorithms for Individually Fair $k$-Clustering"

10 / 10 papers shown

Title
A Polynomial-Time Approximation for Pairwise Fair $k$ -Median Clustering Sayan Bandyapadhyay E. Chlamtác Yu. S. Makarychev A. Vakilian Yury Makarychev Ali Vakilian 40 1 0 16 May 2024
Fair Clustering: A Causal Perspective Fritz M. Bayer Drago Plečko N. Beerenwinkel Jack Kuipers FaML 25 0 0 14 Dec 2023
Fair Wasserstein Coresets Zikai Xiong Niccolò Dalmasso Shubham Sharma Freddy Lecue Daniele Magazzeni Vamsi K. Potluru T. Balch Manuela Veloso 34 2 0 09 Nov 2023
Bicriteria Approximation Algorithms for Priority Matroid Median Tanvi Bajpai C. Chekuri 21 1 0 04 Oct 2022
Measuring and mitigating voting access disparities: a study of race and polling locations in Florida and North Carolina Mohsen Abbasi Suresh Venkatasubramanian Sorelle A. Friedler K. Lum Calvin Barrett 27 3 0 30 May 2022
Fair Representation Clustering with Several Protected Classes Zhen Dai Yury Makarychev A. Vakilian FaML 63 9 0 03 Feb 2022
Modification-Fair Cluster Editing Vincent Froese Leon Kellerhals R. Niedermeier 32 12 0 06 Dec 2021
Efficient Algorithms For Fair Clustering with a New Fairness Notion Shivam Gupta Ganesh Ghalme N. C. Krishnan Shweta Jain FaML 60 8 0 02 Sep 2021
Near-Optimal Explainable $k$ -Means for All Dimensions Moses Charikar Lunjia Hu 28 18 0 29 Jun 2021
Revisiting Priority $k$ -Center: Fairness and Outliers Tanvi Bajpai Deeparnab Chakrabarty C. Chekuri Maryam Negahbani 27 11 0 04 Mar 2021