@InProceedings{delling_et_al:OASIcs.ATMOS.2011.52,
author = {Delling, Daniel and Goldberg, Andrew V. and Werneck, Renato F.},
title = {{Faster Batched Shortest Paths in Road Networks}},
booktitle = {11th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems},
pages = {52--63},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-33-0},
ISSN = {2190-6807},
year = {2011},
volume = {20},
editor = {Caprara, Alberto and Kontogiannis, Spyros},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2011.52},
URN = {urn:nbn:de:0030-drops-32663},
doi = {10.4230/OASIcs.ATMOS.2011.52},
annote = {Keywords: shortest paths, contraction hierarchies, many-to-many, one-to-many}
}