@InProceedings{wang_et_al:LIPIcs.SoCG.2018.72, author = {Wang, Haitao and Zhang, Jingru}, title = {{An O(n log n)-Time Algorithm for the k-Center Problem in Trees}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {72:1--72:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-066-8}, ISSN = {1868-8969}, year = {2018}, volume = {99}, editor = {Speckmann, Bettina and T\'{o}th, Csaba D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.72}, URN = {urn:nbn:de:0030-drops-87852}, doi = {10.4230/LIPIcs.SoCG.2018.72}, annote = {Keywords: k-center, trees, facility locations} }