{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,23]],"date-time":"2025-08-23T00:06:43Z","timestamp":1755907603250,"version":"3.44.0"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T00:00:00Z","timestamp":1730160000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,10,29]]},"DOI":"10.1145\/3678717.3691305","type":"proceedings-article","created":{"date-parts":[[2024,11,22]],"date-time":"2024-11-22T06:29:21Z","timestamp":1732256961000},"page":"613-616","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Routing As a Relevance System"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-4509-3222","authenticated-orcid":false,"given":"Dragomir","family":"Yankov","sequence":"first","affiliation":[{"name":"Microsoft, Mountain View, California, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7939-1408","authenticated-orcid":false,"given":"Antonios","family":"Karatzoglou","sequence":"additional","affiliation":[{"name":"Microsoft, Mountain View, California, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4332-6126","authenticated-orcid":false,"given":"Chiqun","family":"Zhang","sequence":"additional","affiliation":[{"name":"Microsoft, Mountain View, California, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0893-3975","authenticated-orcid":false,"given":"Mike","family":"Evans","sequence":"additional","affiliation":[{"name":"Microsoft, Redmond, Washington, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8961-3553","authenticated-orcid":false,"given":"Oussama","family":"Dhifallah","sequence":"additional","affiliation":[{"name":"Microsoft, Redmond, Washington, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-7926-4413","authenticated-orcid":false,"given":"Florin","family":"Sabau","sequence":"additional","affiliation":[{"name":"Microsoft, Redmond, Washington, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-0892-8164","authenticated-orcid":false,"given":"Maryam Mousaarab","family":"Najafabadi","sequence":"additional","affiliation":[{"name":"Microsoft, Redmond, Washington, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-3068-2454","authenticated-orcid":false,"given":"Goran","family":"Predovic","sequence":"additional","affiliation":[{"name":"Microsoft, Redmond, Washington, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,11,22]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Werneck","author":"Abraham Ittai","year":"2013","unstructured":"Ittai Abraham, Daniel Delling, Andrew V. Goldberg, and Renato F. Werneck. 2013. Alternative Routes in Road Networks. ACM J. Exp. Algorithmics (2013)."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.3390\/bdcc5040080"},{"key":"e_1_3_2_1_3_1","unstructured":"Cambridge Vehicle Information Technology CAMVIT. 2005. Choice Routing. http:\/\/www.camvit.com\/camvit-technical-english\/Camvit-Choice-Routing-Explanation-english.pdf."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497474"},{"key":"e_1_3_2_1_5_1","volume-title":"SEA 2011, Kolimpari, Chania, Crete, Greece, May 5-7, 2011. Proceedings (Lecture Notes in Computer Science","volume":"387","author":"Delling Daniel","year":"2011","unstructured":"Daniel Delling, Andrew V. Goldberg, Thomas Pajor, and Renato Fonseca F. Werneck. 2011. Customizable Route Planning. In Experimental Algorithms - 10th International Symposium, SEA 2011, Kolimpari, Chania, Crete, Greece, May 5-7, 2011. Proceedings (Lecture Notes in Computer Science, Vol. 6630). Springer, 376--387."},{"key":"e_1_3_2_1_6_1","volume-title":"Customizable Contraction Hierarchies. ACM J. Exp. Algorithmics 21","author":"Dibbelt Julian","year":"2016","unstructured":"Julian Dibbelt, Ben Strasser, and Dorothea Wagner. 2016. Customizable Contraction Hierarchies. ACM J. Exp. Algorithmics 21 (2016)."},{"key":"e_1_3_2_1_7_1","volume-title":"A note on two problems in connexion with graphs. Numer. Math. 1, 1","author":"Dijkstra E. W.","year":"1959","unstructured":"E. W. Dijkstra. 1959. A note on two problems in connexion with graphs. Numer. Math. 1, 1 (1959)."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.1110.0401"},{"volume-title":"Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Andrew","key":"e_1_3_2_1_9_1","unstructured":"Andrew V. Goldberg and Chris Harrelson. 2005. Computing the shortest path: A search meets graph theory. In Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Vancouver, British Columbia) (SODA '05). Society for Industrial and Applied Mathematics."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3557915.3561006"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3557991.3567782"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3274895.3274983"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.14778\/3551793.3551863"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1111\/tgis.12526"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"Giacomo Nannicini Daniel Delling Dominik Schultes and Leo Liberti. 2012. Bidirectional A* Search on Time-Dependent Road Networks. Netw. (2012).","DOI":"10.1002\/net.20438"},{"key":"e_1_3_2_1_16_1","volume-title":"Fast and Exact Routing in Time-Dependent Road Networks. Algorithms 14, 3","author":"Strasser Ben","year":"2021","unstructured":"Ben Strasser, Dorothea Wagner, and Tim Zeitz. 2021. Space-Efficient, Fast and Exact Routing in Time-Dependent Road Networks. Algorithms 14, 3 (2021)."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2093973.2093980"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3589132.3625595"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.14778\/3476311.3476383"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2015.7113349"}],"event":{"name":"SIGSPATIAL '24: The 32nd ACM International Conference on Advances in Geographic Information Systems","sponsor":["SIGSPATIAL ACM Special Interest Group on Spatial Information"],"location":"Atlanta GA USA","acronym":"SIGSPATIAL '24"},"container-title":["Proceedings of the 32nd ACM International Conference on Advances in Geographic Information Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3678717.3691305","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3678717.3691305","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T10:42:14Z","timestamp":1755859334000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3678717.3691305"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,29]]},"references-count":20,"alternative-id":["10.1145\/3678717.3691305","10.1145\/3678717"],"URL":"https:\/\/doi.org\/10.1145\/3678717.3691305","relation":{},"subject":[],"published":{"date-parts":[[2024,10,29]]},"assertion":[{"value":"2024-11-22","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}