Anup Bhattacharya, Dishant Goyal, Ragesh Jaiswal. Hardness of Approximation for Euclidean k-Median. In Mary Wootters, Laura Sanità, editors, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2021, August 16-18, 2021, University of Washington, Seattle, Washington, USA (Virtual Conference). Volume 207 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. [doi]
@inproceedings{BhattacharyaGJ21,
title = {Hardness of Approximation for Euclidean k-Median},
author = {Anup Bhattacharya and Dishant Goyal and Ragesh Jaiswal},
year = {2021},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2021.4},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.4},
researchr = {https://researchr.org/publication/BhattacharyaGJ21},
cites = {0},
citedby = {0},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2021, August 16-18, 2021, University of Washington, Seattle, Washington, USA (Virtual Conference)},
editor = {Mary Wootters and Laura Sanità},
volume = {207},
series = {LIPIcs},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
isbn = {978-3-95977-207-5},
}