{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,24]],"date-time":"2025-08-24T01:30:35Z","timestamp":1755999035761,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,11,5]],"date-time":"2013-11-05T00:00:00Z","timestamp":1383609600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["1324"],"award-info":[{"award-number":["1324"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004963","name":"Seventh Framework Programme","doi-asserted-by":"publisher","award":["FP7-ICT-2011-SME-DCL-296423"],"award-info":[{"award-number":["FP7-ICT-2011-SME-DCL-296423"]}],"id":[{"id":"10.13039\/501100004963","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,11,5]]},"DOI":"10.1145\/2525314.2525362","type":"proceedings-article","created":{"date-parts":[[2014,1,14]],"date-time":"2014-01-14T13:40:06Z","timestamp":1389706806000},"page":"164-173","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":17,"title":["Routing directions"],"prefix":"10.1145","author":[{"given":"Dimitris","family":"Sacharidis","sequence":"first","affiliation":[{"name":"Institute for the Mgmt. of Information Systems, \"Athena\" Research Center, Athens, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Panagiotis","family":"Bouros","sequence":"additional","affiliation":[{"name":"Humboldt-Universit\u00e4t zu Berlin, Berlin, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,11,5]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-20662-7_20"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1498698.1537599"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1671970.1671976"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.32.6.1381"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/366105.366184"},{"key":"e_1_3_2_1_6_1","volume-title":"Journal of Parallel and Distributed Computing","author":"Delling D.","year":"2012","unstructured":"D. Delling , A. V. Goldberg , A. Nowatzyk , and R. F. Werneck . Phast: Hardware-accelerated shortest path trees . Journal of Parallel and Distributed Computing , 2012 . D. Delling, A. V. Goldberg, A. Nowatzyk, and R. F. Werneck. Phast: Hardware-accelerated shortest path trees. Journal of Parallel and Distributed Computing, 2012."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-39923-0_12"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-68552-4_24"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/2008623.2008634"},{"key":"e_1_3_2_1_11_1","first-page":"156","volume-title":"Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms","author":"Goldberg A. V.","year":"2005","unstructured":"A. V. Goldberg and C. Harrelson . Computing the shortest path: A search meets graph theory . In Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms , pages 156 -- 165 . Society for Industrial and Applied Mathematics , 2005 . A. V. Goldberg and C. Harrelson. Computing the shortest path: A search meets graph theory. In Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms, pages 156--165. Society for Industrial and Applied Mathematics, 2005."},{"key":"e_1_3_2_1_12_1","first-page":"100","volume-title":"ALENEX\/ANALC","author":"Gutman R. J.","year":"2004","unstructured":"R. J. Gutman . Reach-based routing : A new approach to shortest path algorithms optimized for road networks . In ALENEX\/ANALC , pages 100 -- 111 , 2004 . R. J. Gutman. Reach-based routing: A new approach to shortest path algorithms optimized for road networks. In ALENEX\/ANALC, pages 100--111, 2004."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1080\/13658816.2010.510799"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2010.5447845"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.v46:2"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1187436.1216585"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/9.3.275"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2008.02.002"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2525314.2525362"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/11561071_51"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/646680.702320"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1020853410145"}],"event":{"name":"SIGSPATIAL'13: 21st SIGSPATIAL International Conference on Advances in Geographic Information Systems","sponsor":["SIGSPATIAL ACM Special Interest Group on Spatial Information","SIGGRAPH ACM Special Interest Group on Computer Graphics and Interactive Techniques"],"location":"Orlando Florida","acronym":"SIGSPATIAL'13"},"container-title":["Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2525314.2525362","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2525314.2525362","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:28:23Z","timestamp":1750231703000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2525314.2525362"}},"subtitle":["keeping it fast and simple"],"short-title":[],"issued":{"date-parts":[[2013,11,5]]},"references-count":22,"alternative-id":["10.1145\/2525314.2525362","10.1145\/2525314"],"URL":"https:\/\/doi.org\/10.1145\/2525314.2525362","relation":{},"subject":[],"published":{"date-parts":[[2013,11,5]]},"assertion":[{"value":"2013-11-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}