Algorithms for fair \(k\)-clustering with multiple protected attributes

DOI10.1016/j.orl.2021.08.011OpenAlexW3197665859WikidataQ116754429 ScholiaQ116754429MaRDI QIDQ2060384

Chris Schwiegelshohn, Matteo Böhm, Cristina Menghini, Adriano Fazzone, Stefano Leonardi

Publication date: 13 December 2021

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2021.08.011

zbMATH Keywords

clusteringapproximationalgorithmic fairness

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items (1)

Efficient algorithms for fair clustering with a new notion of fairness

Cites Work

• Fair coresets and streaming algorithms for fair \(k\)-means
• On the cost of essentially fair clusterings
• A new coreset framework for clustering
• Unnamed Item
• Unnamed Item

This page was built for publication: Algorithms for fair \(k\)-clustering with multiple protected attributes