{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:15:55Z","timestamp":1750306555104,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":3,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,11,4]],"date-time":"2014-11-04T00:00:00Z","timestamp":1415059200000},"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":[[2014,11,4]]},"DOI":"10.1145\/2666310.2666474","type":"proceedings-article","created":{"date-parts":[[2015,2,3]],"date-time":"2015-02-03T13:43:11Z","timestamp":1422970991000},"page":"441-444","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Fast approximation of reach hierarchies in networks"],"prefix":"10.1145","author":[{"given":"Joris","family":"Maervoet","sequence":"first","affiliation":[{"name":"KU Leuven, Gent, Belgium"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Patrick","family":"De Causmaecker","sequence":"additional","affiliation":[{"name":"KU Leuven, Kortrijk, Belgium"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Greet Vanden","family":"Berghe","sequence":"additional","affiliation":[{"name":"KU Leuven, Gent, Belgium"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2014,11,4]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972863.13"},{"key":"e_1_3_2_1_2_1","first-page":"100","volume-title":"Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithmics and Combinatorics","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 L. Arge, G. F. Italiano, and R. Sedgewick, editors , Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithmics and Combinatorics , New Orleans, LA, USA , January 10, 2004 , pages 100 - 111 . SIAM, 2004. R. J. Gutman. Reach-based routing: A new approach to shortest path algorithms optimized for road networks. In L. Arge, G. F. Italiano, and R. Sedgewick, editors, Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithmics and Combinatorics, New Orleans, LA, USA, January 10, 2004, pages 100-111. SIAM, 2004."},{"key":"e_1_3_2_1_3_1","volume-title":"KU Leuven","author":"Maervoet J.","year":"2014","unstructured":"J. Maervoet , G. Vanden Berghe , and P. De Causmaecker . Fast approximation of reach hierarchies in networks: Related work, proofs and coherence. Technical report , KU Leuven , Department of Computer Science , 2014 . J. Maervoet, G. Vanden Berghe, and P. De Causmaecker. Fast approximation of reach hierarchies in networks: Related work, proofs and coherence. Technical report, KU Leuven, Department of Computer Science, 2014."}],"event":{"name":"SIGSPATIAL '14: 22nd SIGSPATIAL International Conference on Advances in Geographic Information Systems","sponsor":["ESRI","Yandex","Google Inc.","NVIDIA","University of North Texas University of North Texas","Microsoft Microsoft","ORACLE ORACLE","Facebook Facebook","SIGSPATIAL ACM Special Interest Group on Spatial Information"],"location":"Dallas Texas","acronym":"SIGSPATIAL '14"},"container-title":["Proceedings of the 22nd ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2666310.2666474","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2666310.2666474","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:12:50Z","timestamp":1750227170000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2666310.2666474"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,11,4]]},"references-count":3,"alternative-id":["10.1145\/2666310.2666474","10.1145\/2666310"],"URL":"https:\/\/doi.org\/10.1145\/2666310.2666474","relation":{},"subject":[],"published":{"date-parts":[[2014,11,4]]},"assertion":[{"value":"2014-11-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}