@InProceedings{awasthi_et_al:LIPIcs.SOCG.2015.754,
author = {Awasthi, Pranjal and Charikar, Moses and Krishnaswamy, Ravishankar and Sinop, Ali Kemal},
title = {{The Hardness of Approximation of Euclidean k-Means}},
booktitle = {31st International Symposium on Computational Geometry (SoCG 2015)},
pages = {754--767},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-83-5},
ISSN = {1868-8969},
year = {2015},
volume = {34},
editor = {Arge, Lars and Pach, J\'{a}nos},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SOCG.2015.754},
URN = {urn:nbn:de:0030-drops-51178},
doi = {10.4230/LIPIcs.SOCG.2015.754},
annote = {Keywords: Euclidean k-means, Hardness of Approximation, Vertex Cover}
}