{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:23:26Z","timestamp":1750307006318,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":9,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,11,6]],"date-time":"2012-11-06T00:00:00Z","timestamp":1352160000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2012,11,6]]},"DOI":"10.1145\/2442942.2442943","type":"proceedings-article","created":{"date-parts":[[2013,2,22]],"date-time":"2013-02-22T19:25:33Z","timestamp":1361561133000},"page":"1-1","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Real-world route planning"],"prefix":"10.1145","author":[{"given":"Renato F.","family":"Werneck","sequence":"first","affiliation":[{"name":"Microsoft Research Silicon Valley"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,11,6]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"I.\n       \n      Abraham D.\n       \n      Delling A. V.\n       \n      Goldberg and \n      \n      \n      R. F.\n       \n      Werneck\n      \n  \n  . \n  A Hub-Based Labeling Algorithm for Shortest Paths on Road Networks. In P. M. Pardalos and S. Rebennack editors Experimental Algorithms (SEA) volume \n  6630\n   of \n  LNCS pages \n  230\n  --\n  241\n  . \n  Springer 2011\n  .   I. Abraham D. Delling A. V. Goldberg and R. F. Werneck. A Hub-Based Labeling Algorithm for Shortest Paths on Road Networks. In P. M. Pardalos and S. Rebennack editors Experimental Algorithms (SEA) volume 6630 of LNCS pages 230--241. Springer 2011.","key":"e_1_3_2_1_1_1","DOI":"10.1007\/978-3-642-20662-7_20"},{"issue":"5824","key":"e_1_3_2_1_2_1","first-page":"566","volume":"316","author":"Bast H.","year":"2007","journal-title":"Fast Routing in Road Networks with Transit Nodes. Science"},{"doi-asserted-by":"crossref","unstructured":"D.\n       \n      Delling A. V.\n       \n      Goldberg T.\n       \n      Pajor and \n      \n      \n      R. F.\n       \n      Werneck\n      \n  \n  . \n  Customizable Route Planning. In P. M. Pardalos and S. Rebennack editors Experimental Algorithms (SEA) volume \n  6630\n   of \n  LNCS pages \n  376\n  --\n  387\n  . \n  Springer 2011\n  .   D. Delling A. V. Goldberg T. Pajor and R. F. Werneck. Customizable Route Planning. In P. M. Pardalos and S. Rebennack editors Experimental Algorithms (SEA) volume 6630 of LNCS pages 376--387. Springer 2011.","key":"e_1_3_2_1_3_1","DOI":"10.1007\/978-3-642-20662-7_32"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_4_1","DOI":"10.1109\/IPDPS.2011.108"},{"key":"e_1_3_2_1_5_1","first-page":"130","volume-title":"Algorithm Engineering and Experiments (ALENEX)","author":"Delling D.","year":"2012"},{"doi-asserted-by":"crossref","unstructured":"E. W. Dijkstra. A Note on Two Problems in Connexion with Graphs. Numerische Mathematik 1:269--271 1959.  E. W. Dijkstra. A Note on Two Problems in Connexion with Graphs. Numerische Mathematik 1:269--271 1959.","key":"e_1_3_2_1_6_1","DOI":"10.1007\/BF01386390"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_7_1","DOI":"10.1287\/trsc.1110.0401"},{"doi-asserted-by":"crossref","unstructured":"A. V.\n       \n      Goldberg H.\n       \n      Kaplan and \n      \n      \n      R. F.\n       \n      Werneck\n      \n  \n  . \n  Reach for A*: Shortest Path Algorithms with Preprocessing. In C. Demetrescu A. V. Goldberg and D. S. Johnson editors The Shortest Path Problem: Ninth DIMACS Implementation Challenge volume \n  74\n   of \n  DIMACS Book pages \n  93\n  --\n  139\n  . \n  AMS 2009\n  .  A. V. Goldberg H. Kaplan and R. F. Werneck. Reach for A*: Shortest Path Algorithms with Preprocessing. In C. Demetrescu A. V. Goldberg and D. S. Johnson editors The Shortest Path Problem: Ninth DIMACS Implementation Challenge volume 74 of DIMACS Book pages 93--139. AMS 2009.","key":"e_1_3_2_1_8_1","DOI":"10.1090\/dimacs\/074\/05"},{"doi-asserted-by":"crossref","unstructured":"M.\n       \n      Hilger E.\n       \n      K\u00f6hler R. H.\n       \n      M\u00f6hring and \n      \n      \n      H.\n       \n      Schilling\n      \n  \n  . \n  Fast Point-to-Point Shortest Path Computations with Arc-Flags. In C. Demetrescu A. V. Goldberg and D. S. Johnson editors The Shortest Path Problem: Ninth DIMACS Implementation Challenge volume \n  74\n   of \n  DIMACS Book pages \n  41\n  --\n  72\n  . \n  AMS 2009\n  .  M. Hilger E. K\u00f6hler R. H. M\u00f6hring and H. Schilling. Fast Point-to-Point Shortest Path Computations with Arc-Flags. In C. Demetrescu A. V. Goldberg and D. S. Johnson editors The Shortest Path Problem: Ninth DIMACS Implementation Challenge volume 74 of DIMACS Book pages 41--72. AMS 2009.","key":"e_1_3_2_1_9_1","DOI":"10.1090\/dimacs\/074\/03"}],"event":{"sponsor":["SIGSPATIAL ACM Special Interest Group on Spatial Information","SIGGRAPH ACM Special Interest Group on Computer Graphics and Interactive Techniques"],"acronym":"SIGSPATIAL'12","name":"SIGSPATIAL'12: SIGSPATIAL 2012 International Conference on Advances in Geographic Information Systems","location":"Redondo Beach California"},"container-title":["Proceedings of the 5th ACM SIGSPATIAL International Workshop on Computational Transportation Science"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2442942.2442943","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2442942.2442943","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:48:56Z","timestamp":1750236536000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2442942.2442943"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,11,6]]},"references-count":9,"alternative-id":["10.1145\/2442942.2442943","10.1145\/2442942"],"URL":"https:\/\/doi.org\/10.1145\/2442942.2442943","relation":{},"subject":[],"published":{"date-parts":[[2012,11,6]]},"assertion":[{"value":"2012-11-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}