{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:21:52Z","timestamp":1750220512292,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":29,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,4,19]],"date-time":"2021-04-19T00:00:00Z","timestamp":1618790400000},"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":[[2021,4,19]]},"DOI":"10.1145\/3442381.3450083","type":"proceedings-article","created":{"date-parts":[[2021,6,3]],"date-time":"2021-06-03T19:02:07Z","timestamp":1622746927000},"page":"3918-3929","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Sketch-based Algorithms for Approximate Shortest Paths in Road Networks"],"prefix":"10.1145","author":[{"given":"Gaurav","family":"Aggarwal","sequence":"first","affiliation":[{"name":"Google, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sreenivas","family":"Gollapudi","sequence":"additional","affiliation":[{"name":"Google, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Raghavender","sequence":"additional","affiliation":[{"name":"Google, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ali Kemal","family":"Sinop","sequence":"additional","affiliation":[{"name":"Google, Turkey"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,6,3]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Alternative routes in road networks. ACM J. Exp. Algorithmics 18","author":"Abraham Ittai","year":"2013","unstructured":"Ittai Abraham , Daniel Delling , Andrew\u00a0 V. Goldberg , and Renato\u00a0 F. Werneck . 2013. Alternative routes in road networks. ACM J. Exp. Algorithmics 18 ( 2013 ). https:\/\/doi.org\/10.1145\/2444016.2444019 Ittai Abraham, Daniel Delling, Andrew\u00a0V. Goldberg, and Renato\u00a0F. Werneck. 2013. Alternative routes in road networks. ACM J. Exp. Algorithmics 18 (2013). https:\/\/doi.org\/10.1145\/2444016.2444019"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2566486.2568007"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2008.10129297"},{"volume-title":"Algorithm engineering","author":"Bast Hannah","key":"e_1_3_2_1_4_1","unstructured":"Hannah Bast , Daniel Delling , Andrew Goldberg , Matthias M\u00fcller-Hannemann , Thomas Pajor , Peter Sanders , Dorothea Wagner , and Renato\u00a0 F Werneck . 2016. Route planning in transportation networks . In Algorithm engineering . Springer , 19\u201380. Hannah Bast, Daniel Delling, Andrew Goldberg, Matthias M\u00fcller-Hannemann, Thomas Pajor, Peter Sanders, Dorothea Wagner, and Renato\u00a0F Werneck. 2016. Route planning in transportation networks. In Algorithm engineering. Springer, 19\u201380."},{"volume-title":"Vehicle Information Tech","key":"e_1_3_2_1_5_1","unstructured":"Cambridge. 2005. Vehicle Information Tech . Ltd . Choice routing. http:\/\/camvit.com\/camvit-technical-english\/Camvit-Choice-Routing-Explanation-english.pdf. Accessed: 2020-10-16. Cambridge. 2005. Vehicle Information Tech. Ltd. Choice routing. http:\/\/camvit.com\/camvit-technical-english\/Camvit-Choice-Routing-Explanation-english.pdf. Accessed: 2020-10-16."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2015.2411606"},{"key":"e_1_3_2_1_7_1","volume-title":"Introduction to Algorithms","author":"Cormen H.","unstructured":"Thomas\u00a0 H. Cormen , Charles\u00a0 E. Leiserson , Ronald\u00a0 L. Rivest , and Clifford Stein . 2001. Introduction to Algorithms ( 2 nd ed.). The MIT Press . Thomas\u00a0H. Cormen, Charles\u00a0E. Leiserson, Ronald\u00a0L. Rivest, and Clifford Stein. 2001. Introduction to Algorithms(2nd ed.). The MIT Press.","edition":"2"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.2014.0579"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2011.108"},{"key":"e_1_3_2_1_10_1","volume-title":"16th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems, ACM-GIS","author":"Eppstein David","year":"2008","unstructured":"David Eppstein and Michael\u00a0 T. Goodrich . 2008. Studying (non-planar) road networks through an algorithmic lens. In 16th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems, ACM-GIS 2008 , November 5-7, 2008, Irvine, California, USA , Proceedings, Walid\u00a0G. Aref, Mohamed\u00a0F. Mokbel, and Markus Schneider (Eds.). ACM , 16. https:\/\/doi.org\/10.1145\/1463434.1463455 David Eppstein and Michael\u00a0T. Goodrich. 2008. Studying (non-planar) road networks through an algorithmic lens. In 16th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems, ACM-GIS 2008, November 5-7, 2008, Irvine, California, USA, Proceedings, Walid\u00a0G. Aref, Mohamed\u00a0F. Mokbel, and Markus Schneider (Eds.). ACM, 16. https:\/\/doi.org\/10.1145\/1463434.1463455"},{"key":"e_1_3_2_1_11_1","volume-title":"SODA","author":"Gluch G.","year":"2021","unstructured":"G. Gluch , M. Kapralov , S. Lattanzi , A. Mousavifar , and C. Sohler . 2021. Spectral Clustering Oracles in Sublinear Time. In To appear in ACM-SIAM Symposium on Discrete Algorithms , SODA 2021 . G. Gluch, M. Kapralov, S. Lattanzi, A. Mousavifar, and C. Sohler. 2021. Spectral Clustering Oracles in Sublinear Time. In To appear in ACM-SIAM Symposium on Discrete Algorithms, SODA 2021."},{"key":"e_1_3_2_1_12_1","volume-title":"Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2005","author":"V.","year":"2005","unstructured":"Andrew\u00a0 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, SODA 2005 , Vancouver, British Columbia, Canada , January 23-25, 2005 . SIAM, 156\u2013165. http:\/\/dl.acm.org\/citation.cfm?id=1070432.1070455 Andrew\u00a0V. 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, SODA 2005, Vancouver, British Columbia, Canada, January 23-25, 2005. SIAM, 156\u2013165. http:\/\/dl.acm.org\/citation.cfm?id=1070432.1070455"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479896312262"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1871437.1871503"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/990308.990313"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827595287997"},{"key":"e_1_3_2_1_19_1","article-title":"Candidate Sets for Alternative Routes in Road Networks","volume":"19","author":"Luxen Dennis","year":"2014","unstructured":"Dennis Luxen and Dennis Schieferdecker . 2014 . Candidate Sets for Alternative Routes in Road Networks . ACM J. Exp. Algorithmics 19 , 1 (2014). https:\/\/doi.org\/10.1145\/2674395 Dennis Luxen and Dennis Schieferdecker. 2014. Candidate Sets for Alternative Routes in Road Networks. ACM J. Exp. Algorithmics 19, 1 (2014). https:\/\/doi.org\/10.1145\/2674395","journal-title":"ACM J. Exp. Algorithmics"},{"volume-title":"Experimental Algorithms","author":"Maue Jens","key":"e_1_3_2_1_20_1","unstructured":"Jens Maue , Peter Sanders , and Domagoj Matijevic . 2006. Goal Directed Shortest Path Queries Using Precomputed Cluster Distances . In Experimental Algorithms . Springer Berlin Heidelberg , 316\u2013327. Jens Maue, Peter Sanders, and Domagoj Matijevic. 2006. Goal Directed Shortest Path Queries Using Precomputed Cluster Distances. In Experimental Algorithms. Springer Berlin Heidelberg, 316\u2013327."},{"key":"e_1_3_2_1_21_1","volume-title":"NIPS 2001","author":"Ng Y.","year":"2001","unstructured":"Andrew\u00a0 Y. Ng , Michael\u00a0 I. Jordan , and Yair Weiss . 2001 . On Spectral Clustering: Analysis and an algorithm. In Advances in Neural Information Processing Systems 14 [Neural Information Processing Systems: Natural and Synthetic , NIPS 2001 , December 3-8, 2001, Vancouver, British Columbia, Canada], Thomas\u00a0G. Dietterich, Suzanna Becker, and Zoubin Ghahramani(Eds.). MIT Press, 849\u2013856. http:\/\/papers.nips.cc\/paper\/ 2092-on-spectral-clustering-analysis-and-an-algorithm Andrew\u00a0Y. Ng, Michael\u00a0I. Jordan, and Yair Weiss. 2001. On Spectral Clustering: Analysis and an algorithm. In Advances in Neural Information Processing Systems 14 [Neural Information Processing Systems: Natural and Synthetic, NIPS 2001, December 3-8, 2001, Vancouver, British Columbia, Canada], Thomas\u00a0G. Dietterich, Suzanna Becker, and Zoubin Ghahramani(Eds.). MIT Press, 849\u2013856. http:\/\/papers.nips.cc\/paper\/2092-on-spectral-clustering-analysis-and-an-algorithm"},{"key":"e_1_3_2_1_22_1","unstructured":"OpenStreetMap contributors. 2017. Planet dump retrieved from https:\/\/planet.osm.org. https:\/\/www.openstreetmap.org.  OpenStreetMap contributors. 2017. Planet dump retrieved from https:\/\/planet.osm.org. https:\/\/www.openstreetmap.org."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.83"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1718487.1718537"},{"key":"e_1_3_2_1_25_1","volume-title":"On Balanced Separators in Road Networks. In 14th International Symposium on Experimental Algorithms (SEA). 286\u2013297","author":"Schild Aaron","year":"2015","unstructured":"Aaron Schild and Christian Sommer . 2015 . On Balanced Separators in Road Networks. In 14th International Symposium on Experimental Algorithms (SEA). 286\u2013297 . https:\/\/doi.org\/10.1007\/978-3-319-20086-6_22 Aaron Schild and Christian Sommer. 2015. On Balanced Separators in Road Networks. In 14th International Symposium on Experimental Algorithms (SEA). 286\u2013297. https:\/\/doi.org\/10.1007\/978-3-319-20086-6_22"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974331.ch128"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1137\/080744888"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1044731.1044732"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2063576.2063834"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3035955"}],"event":{"name":"WWW '21: The Web Conference 2021","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"],"location":"Ljubljana Slovenia","acronym":"WWW '21"},"container-title":["Proceedings of the Web Conference 2021"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3442381.3450083","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3442381.3450083","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:24:27Z","timestamp":1750195467000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3442381.3450083"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,19]]},"references-count":29,"alternative-id":["10.1145\/3442381.3450083","10.1145\/3442381"],"URL":"https:\/\/doi.org\/10.1145\/3442381.3450083","relation":{},"subject":[],"published":{"date-parts":[[2021,4,19]]},"assertion":[{"value":"2021-06-03","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}