Ioana Oriana Bercea, Martin Groß 0001, Samir Khuller, Aounon Kumar, Clemens Rösner, Daniel R. Schmidt, Melanie Schmidt 0001. On the Cost of Essentially Fair Clusterings. In Dimitris Achlioptas, László A. Végh, editors, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA. Volume 145 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. [doi]
@inproceedings{Bercea0KKRS019,
title = {On the Cost of Essentially Fair Clusterings},
author = {Ioana Oriana Bercea and Martin Groß 0001 and Samir Khuller and Aounon Kumar and Clemens Rösner and Daniel R. Schmidt and Melanie Schmidt 0001},
year = {2019},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2019.18},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.18},
researchr = {https://researchr.org/publication/Bercea0KKRS019},
cites = {0},
citedby = {0},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA},
editor = {Dimitris Achlioptas and László A. Végh},
volume = {145},
series = {LIPIcs},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
isbn = {978-3-95977-125-2},
}