%0 Conference Paper %1 conf/dimacs/SandersS06 %A Sanders, Peter %A Schultes, Dominik %B The Shortest Path Problem %D 2006 %E Demetrescu, Camil %E Goldberg, Andrew V. %E Johnson, David S. %I DIMACS/AMS %K dblp %P 193-218 %T Robust, Almost Constant Time Shortest-Path Queries in Road Networks. %U http://dblp.uni-trier.de/db/conf/dimacs/dimacs74.html#SandersS06 %V 74 %@ 978-0-8218-4383-3

@inproceedings{conf/dimacs/SandersS06, added-at = {2022-06-09T00:00:00.000+0200}, author = {Sanders, Peter and Schultes, Dominik}, biburl = {https://www.bibsonomy.org/bibtex/2e20dae285217f93817d5803ea495f035/dblp}, booktitle = {The Shortest Path Problem}, crossref = {conf/dimacs/dimacs74}, editor = {Demetrescu, Camil and Goldberg, Andrew V. and Johnson, David S.}, ee = {https://doi.org/10.1090/dimacs/074/08}, interhash = {b8b3be776b6de5a4840c413efeae25d6}, intrahash = {e20dae285217f93817d5803ea495f035}, isbn = {978-0-8218-4383-3}, keywords = {dblp}, pages = {193-218}, publisher = {DIMACS/AMS}, series = {DIMACS Series in Discrete Mathematics and Theoretical Computer Science}, timestamp = {2024-04-09T17:58:57.000+0200}, title = {Robust, Almost Constant Time Shortest-Path Queries in Road Networks.}, url = {http://dblp.uni-trier.de/db/conf/dimacs/dimacs74.html#SandersS06}, volume = 74, year = 2006 }