{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T03:36:35Z","timestamp":1743132995180,"version":"3.40.3"},"publisher-location":"New York, NY","reference-count":20,"publisher":"Springer New York","isbn-type":[{"type":"print","value":"9781493928637"},{"type":"electronic","value":"9781493928644"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-1-4939-2864-4_580","type":"book-chapter","created":{"date-parts":[[2016,4,21]],"date-time":"2016-04-21T20:03:35Z","timestamp":1461269015000},"page":"932-938","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Hub Labeling (2-Hop Labeling)"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Delling","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew V.","family":"Goldberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Renato F.","family":"Werneck","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,4,22]]},"reference":[{"key":"176_CR8137","doi-asserted-by":"crossref","unstructured":"Abraham I, Fiat A, Goldberg AV, Werneck RF (2010) Highway dimension, shortest paths, and provably efficient algorithms. In: Proceedings of 21st ACM-SIAM symposium on discrete algorithms, Austin, pp\u00a0782\u2013793","DOI":"10.1137\/1.9781611973075.64"},{"key":"176_CR8138","doi-asserted-by":"crossref","unstructured":"Abraham I, Delling D, Goldberg AV, Werneck RF (2011) A hub-based labeling algorithm for shortest paths on road networks. In: Proceedings of the 10th international symposium on experimental algorithms (SEA\u201911), Chania. Volume 6630 of Lecture notes in computer science. Springer, pp\u00a0230\u2013241","DOI":"10.1007\/978-3-642-20662-7_20"},{"key":"176_CR8139","first-page":"339","volume-title":"Proceedings of the 20th ACM SIGSPATIAL international symposium on advances in geographic information systems (GIS\u201912)","author":"I Abraham","year":"2012","unstructured":"Abraham I, Delling D, Fiat A, Goldberg AV, Werneck RF (2012) HLDB: location-based services in databases. In: Proceedings of the 20th ACM SIGSPATIAL international symposium on advances in geographic information systems (GIS\u201912), Redondo Beach. ACM, pp\u00a0339\u2013348"},{"key":"176_CR8140","doi-asserted-by":"crossref","unstructured":"Abraham I, Delling D, Goldberg AV, Werneck RF (2012) Hierarchical hub labelings for shortest paths. In: Proceedings of the 20th annual European symposium on algorithms (ESA\u201912), Ljubljana. Volume 7501 of Lecture notes in computer science. Springer, pp\u00a024\u201335","DOI":"10.1007\/978-3-642-33090-2_4"},{"key":"176_CR8141","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1145\/2463676.2465315","volume-title":"Proceedings of the 2013 ACM SIGMOD international conference on management of data, SIGMOD\u201913","author":"T Akiba","year":"2013","unstructured":"Akiba T, Iwata Y, Yoshida Y (2013) Fast exact shortest-path distance queries on large networks by pruned landmark labeling. In: Proceedings of the 2013 ACM SIGMOD international conference on management of data, SIGMOD\u201913, New York. ACM, pp\u00a0349\u2013360"},{"key":"176_CR8142","doi-asserted-by":"crossref","unstructured":"Babenko M, Goldberg AV, Gupta A, Nagarajan V (2013) Algorithms for hub label optimization. In: Fomin FV, Freivalds R, Kwiatkowska M, Peleg D (eds) Proceedings of 30th ICALP, Riga. Lecture notes in computer science, vol\u00a07965. Springer, pp\u00a069\u201380","DOI":"10.1007\/978-3-642-39206-1_7"},{"key":"176_CR8143","unstructured":"Bast H, Delling D, Goldberg AV, M\u00fcller\u2013Hannemann M, Pajor T, Sanders P, Wagner D, Werneck RF (2014) Route planning in transportation networks. Technical report MSR-TR-2014-4, Microsoft research"},{"issue":"3","key":"176_CR8144","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1287\/moor.4.3.233","volume":"4","author":"V Chv\u00e1tal","year":"1979","unstructured":"Chv\u00e1tal V (1979) A greedy heuristic for the set-covering problem. Math Oper Res 4(3): 233\u2013235","journal-title":"Math Oper Res"},{"key":"176_CR8145","doi-asserted-by":"publisher","first-page":"1338","DOI":"10.1137\/S0097539702403098","volume":"32","author":"E Cohen","year":"2003","unstructured":"Cohen E, Halperin E, Kaplan H, Zwick U (2003) Reachability and distance queries via 2-hop labels. SIAM J Comput 32:1338\u20131355","journal-title":"SIAM J Comput"},{"key":"176_CR8146","doi-asserted-by":"crossref","unstructured":"Delling D, Goldberg AV, Werneck RF (2013) Hub label compression. In: Proceedings of the 12th international symposium on experimental algorithms (SEA\u201913), Rome. Volume 7933 of Lecture notes in computer science. Springer, pp\u00a018\u201329","DOI":"10.1007\/978-3-642-38527-8_4"},{"key":"176_CR8147","doi-asserted-by":"crossref","unstructured":"Delling D, Goldberg AV, Savchenko R, Werneck RF (2014) Hub labels: theory and practice. In: Proceedings of the 13th international symposium on experimental algorithms (SEA\u201914), Copenhagen. Lecture notes in computer science. Springer","DOI":"10.1007\/978-3-319-07959-2_22"},{"key":"176_CR8148","doi-asserted-by":"crossref","unstructured":"Delling D, Goldberg AV, Pajor T, Werneck RF (2014, to appear) Robust distance queries on massive networks. In: Proceedings of the 22nd annual European symposium on algorithms (ESA\u201914), Wroclaw. Lecture notes in computer science. Springer","DOI":"10.1007\/978-3-662-44777-2_27"},{"key":"176_CR8149","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra EW (1959) A note on two problems in connexion with graphs. Numer Math 1: 269\u2013271","journal-title":"Numer Math"},{"key":"176_CR8150","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1137\/0218003","volume":"18","author":"G Gallo","year":"1989","unstructured":"Gallo G, Grigoriadis MD, Tarjan RE (1989) A fast parametric maximum flow algorithm and applications. SIAM J Comput 18:30\u201355","journal-title":"SIAM J Comput"},{"issue":"1","key":"176_CR8151","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.jalgor.2004.05.002","volume":"53","author":"C Gavoille","year":"2004","unstructured":"Gavoille C, Peleg D, P\u00e9rennes S, Raz R (2004) Distance labeling in graphs. J Algorithms 53(1): 85\u2013112","journal-title":"J Algorithms"},{"issue":"3","key":"176_CR8152","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1287\/trsc.1110.0401","volume":"46","author":"R Geisberger","year":"2012","unstructured":"Geisberger R, Sanders P, Schultes D, Vetter C (2012) Exact routing in large road networks using contraction hierarchies. Transp Sci 46(3):388\u2013404","journal-title":"Transp Sci"},{"key":"176_CR8153","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1006\/jagm.1994.1032","volume":"17","author":"G Kortsarz","year":"1994","unstructured":"Kortsarz G, Peleg D (1994) Generating sparse 2-spanners. J Algorithms 17:222\u2013236","journal-title":"J Algorithms"},{"issue":"3","key":"176_CR8154","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1002\/(SICI)1097-0118(200003)33:3<167::AID-JGT7>3.0.CO;2-5","volume":"33","author":"D Peleg","year":"2000","unstructured":"Peleg D (2000) Proximity-preserving labeling schemes. J Graph Theory 33(3):167\u2013176","journal-title":"J Graph Theory"},{"key":"176_CR8155","first-page":"71","volume-title":"Intersection in integer inverted indices","author":"P Sanders","year":"2007","unstructured":"Sanders P, Transier F (2007) Intersection in integer inverted indices. SIAM, Philadelphia, pp\u00a071\u201383"},{"key":"176_CR8156","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/978-3-540-24741-8_15","volume-title":"Advances in database technology \u2013 EDBT 2004","author":"R Schenkel","year":"2004","unstructured":"Schenkel R, Theobald A, Weikum G (2004) HOPI: an efficient connection index for complex XML document collections. In: Advances in database technology \u2013 EDBT 2004. Springer, Berlin\/Heidelberg, pp\u00a0237\u2013255"}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4939-2864-4_580","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,6]],"date-time":"2019-09-06T19:06:22Z","timestamp":1567796782000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-4939-2864-4_580"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9781493928637","9781493928644"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-1-4939-2864-4_580","relation":{},"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}