{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T13:43:27Z","timestamp":1775310207695,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,11,1]],"date-time":"2011-11-01T00:00:00Z","timestamp":1320105600000},"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":["933\/5-1"],"award-info":[{"award-number":["933\/5-1"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2011,11]]},"DOI":"10.1145\/2093973.2094062","type":"proceedings-article","created":{"date-parts":[[2012,1,17]],"date-time":"2012-01-17T17:20:41Z","timestamp":1326820841000},"page":"513-516","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":322,"title":["Real-time routing with OpenStreetMap data"],"prefix":"10.1145","author":[{"given":"Dennis","family":"Luxen","sequence":"first","affiliation":[{"name":"Karlsruhe Institute of Technology, Institute of Theoretical Computer Science, Karlsruhe, Germany"}]},{"given":"Christian","family":"Vetter","sequence":"additional","affiliation":[{"name":"Nokia, GmbH, Berlin, Germany"}]}],"member":"320","published-online":{"date-parts":[[2011,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1671970.1671976"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02094-0_7"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.3138\/FM57-6770-U75U-7727"},{"key":"e_1_3_2_1_4_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/978-3-540-68552-4_24","volume-title":"Proceedings of the 7th Workshop on Experimental Algorithms (WEA'08)","author":"Geisberger R.","year":"2008","unstructured":"R. Geisberger , P. Sanders , D. Schultes , and D. Delling . Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks . In C. C. McGeoch, editor, Proceedings of the 7th Workshop on Experimental Algorithms (WEA'08) , volume 5038 of Lecture Notes in Computer Science , pages 319 -- 333 . Springer , June 2008 . R. Geisberger, P. Sanders, D. Schultes, and D. Delling. Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks. In C. C. McGeoch, editor, Proceedings of the 7th Workshop on Experimental Algorithms (WEA'08), volume 5038 of Lecture Notes in Computer Science, pages 319--333. Springer, June 2008."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/2008623.2008634"},{"key":"e_1_3_2_1_6_1","first-page":"156","volume-title":"Proceedings of the 16th Annual ACM--SIAM Symposium on Discrete Algorithms (SODA'05)","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 16th Annual ACM--SIAM Symposium on Discrete Algorithms (SODA'05) , pages 156 -- 165 . SIAM, 2005 . A. V. Goldberg and C. Harrelson. Computing the Shortest Path: A* Search Meets Graph Theory. In Proceedings of the 16th Annual ACM--SIAM Symposium on Discrete Algorithms (SODA'05), pages 156--165. SIAM, 2005."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/177424.178097"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2093973.2094050"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13193-6_8"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972870.4"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/11427186_13"},{"key":"e_1_3_2_1_12_1","unstructured":"MoNav. http:\/\/code.google.com\/p\/monav\/.  MoNav. http:\/\/code.google.com\/p\/monav\/."},{"key":"e_1_3_2_1_13_1","unstructured":"Project OSRM. http:\/\/project-osrm.org.  Project OSRM. http:\/\/project-osrm.org."},{"key":"e_1_3_2_1_14_1","unstructured":"QtQuick. http:\/\/qt.nokia.com\/qtquick.  QtQuick. http:\/\/qt.nokia.com\/qtquick."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87744-8_61"}],"event":{"name":"GIS '11: 19th SIGSPATIAL International Conference on Advances in Geographic Information Systems","location":"Chicago Illinois","acronym":"GIS '11","sponsor":["SIGSPATIAL ACM Special Interest Group on Spatial Information","SIGGRAPH ACM Special Interest Group on Computer Graphics and Interactive Techniques"]},"container-title":["Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2093973.2094062","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2093973.2094062","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:48:40Z","timestamp":1750240120000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2093973.2094062"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,11]]},"references-count":15,"alternative-id":["10.1145\/2093973.2094062","10.1145\/2093973"],"URL":"https:\/\/doi.org\/10.1145\/2093973.2094062","relation":{},"subject":[],"published":{"date-parts":[[2011,11]]},"assertion":[{"value":"2011-11-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}