@InProceedings{chakrabarty_et_al:LIPIcs.STACS.2024.23,
author = {Chakrabarty, Deeparnab and Cote, Luc and Sarkar, Ankita},
title = {{Fault-tolerant k-Supplier with Outliers}},
booktitle = {41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024)},
pages = {23:1--23:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-311-9},
ISSN = {1868-8969},
year = {2024},
volume = {289},
editor = {Beyersdorff, Olaf and Kant\'{e}, Mamadou Moustapha and Kupferman, Orna and Lokshtanov, Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2024.23},
URN = {urn:nbn:de:0030-drops-197336},
doi = {10.4230/LIPIcs.STACS.2024.23},
annote = {Keywords: Clustering, approximation algorithms, round-or-cut}
}