Anna Arutyunova, Melanie Schmidt 0001. Achieving Anonymity via Weak Lower Bound Constraints for k-Median and k-Means. In Markus Bläser, Benjamin Monmege, editors, 38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021, March 16-19, 2021, Saarbrücken, Germany (Virtual Conference). Volume 187 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. [doi]
@inproceedings{Arutyunova021,
title = {Achieving Anonymity via Weak Lower Bound Constraints for k-Median and k-Means},
author = {Anna Arutyunova and Melanie Schmidt 0001},
year = {2021},
doi = {10.4230/LIPIcs.STACS.2021.7},
url = {https://doi.org/10.4230/LIPIcs.STACS.2021.7},
researchr = {https://researchr.org/publication/Arutyunova021},
cites = {0},
citedby = {0},
booktitle = {38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021, March 16-19, 2021, Saarbrücken, Germany (Virtual Conference)},
editor = {Markus Bläser and Benjamin Monmege},
volume = {187},
series = {LIPIcs},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
isbn = {978-3-95977-180-1},
}