Fair coresets and streaming algorithms for fair \(k\)-means

DOI10.1007/978-3-030-39479-0_16OpenAlexW3002138439MaRDI QIDQ2193095

Christian Sohler, Chris Schwiegelshohn, Melanie Schmidt

Publication date: 24 August 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-39479-0_16

Mathematics Subject Classification ID

Approximation algorithms (68W25) Online algorithms; streaming algorithms (68W27)

Related Items (9)

Fair correlation clustering with global and local guarantees ⋮ On the \(k\)-means/median cost function ⋮ Efficient algorithms for fair clustering with a new notion of fairness ⋮ Attraction-repulsion clustering: a way of promoting diversity linked to demographic parity in fair clustering ⋮ Approximation algorithms for the individually fair \(k\)-center with outliers ⋮ Convergence rates of the stochastic alternating algorithm for bi-objective optimization ⋮ On coresets for fair clustering in metric and Euclidean spaces and their applications ⋮ On the cost of essentially fair clusterings ⋮ Algorithms for fair \(k\)-clustering with multiple protected attributes

This page was built for publication: Fair coresets and streaming algorithms for fair \(k\)-means