@InProceedings{chan_et_al:LIPIcs.SoCG.2018.24,
author = {Chan, Timothy M. and Skrepetos, Dimitrios},
title = {{Approximate Shortest Paths and Distance Oracles in Weighted Unit-Disk Graphs}},
booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)},
pages = {24:1--24:13},
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.24},
URN = {urn:nbn:de:0030-drops-87375},
doi = {10.4230/LIPIcs.SoCG.2018.24},
annote = {Keywords: shortest paths, distance oracles, unit-disk graphs, planar graphs}
}