Go to the corresponding LIPIcs Volume Portal 
pdfformat: 

@InProceedings{wang_et_al:LIPIcs:2018:8785, author = {Haitao Wang and Jingru Zhang}, title = {{An O(n log n)Time Algorithm for the kCenter Problem in Trees}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {72:172:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770668}, ISSN = {18688969}, year = {2018}, volume = {99}, editor = {Bettina Speckmann and Csaba D. T{\'o}th}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2018/8785}, URN = {urn:nbn:de:0030drops87852}, doi = {10.4230/LIPIcs.SoCG.2018.72}, annote = {Keywords: kcenter, trees, facility locations} }
Keywords:  kcenter, trees, facility locations  
Seminar:  34th International Symposium on Computational Geometry (SoCG 2018)  
Issue Date:  2018  
Date of publication:  24.05.2018 