{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T07:37:07Z","timestamp":1742974627429,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031221040"},{"type":"electronic","value":"9783031221057"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-22105-7_31","type":"book-chapter","created":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T02:36:12Z","timestamp":1672540572000},"page":"345-356","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Customizable Hub Labeling: Properties and\u00a0Algorithms"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1102-3649","authenticated-orcid":false,"given":"Johannes","family":"Blum","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sabine","family":"Storandt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,1]]},"reference":[{"key":"31_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/978-3-642-20662-7_20","volume-title":"Experimental Algorithms","author":"I Abraham","year":"2011","unstructured":"Abraham, I., Delling, D., Goldberg, A.V., Werneck, R.F.: A hub-based labeling algorithm for shortest paths in road networks. In: Pardalos, P.M., Rebennack, S. (eds.) SEA 2011. LNCS, vol. 6630, pp. 230\u2013241. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20662-7_20"},{"key":"31_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/978-3-642-33090-2_4","volume-title":"Algorithms \u2013 ESA 2012","author":"I Abraham","year":"2012","unstructured":"Abraham, I., Delling, D., Goldberg, A.V., Werneck, R.F.: Hierarchical hub labelings for shortest paths. In: Epstein, L., Ferragina, P. (eds.) ESA 2012. LNCS, vol. 7501, pp. 24\u201335. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33090-2_4"},{"key":"31_CR3","doi-asserted-by":"publisher","unstructured":"Akiba, T., Iwata, Y., Yoshida, Y.: Fast exact shortest-path distance queries on large networks by pruned landmark labeling. In: Ross, K.A., Srivastava, D., Papadias, D. (eds.) Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data (SIGMOD 2013), pp. 349\u2013360. ACM (2013). https:\/\/doi.org\/10.1145\/2463676.2465315","DOI":"10.1145\/2463676.2465315"},{"key":"31_CR4","doi-asserted-by":"publisher","unstructured":"Akiba, T., Iwata, Y., Yoshida, Y.: Dynamic and historical shortest-path distance queries on large evolving networks by pruned landmark labeling. In: Chung, C., Broder, A.Z., Shim, K., Suel, T. (eds.) Proceedings of the 23rd International Conference on World Wide Web (WWW 2014), pp. 237\u2013248. ACM (2014). https:\/\/doi.org\/10.1145\/2566486.2568007","DOI":"10.1145\/2566486.2568007"},{"key":"31_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/978-3-662-48054-0_6","volume-title":"Mathematical Foundations of Computer Science 2015","author":"M Babenko","year":"2015","unstructured":"Babenko, M., Goldberg, A.V., Kaplan, H., Savchenko, R., Weller, M.: On the complexity of hub labeling (extended abstract). In: Italiano, G.F., Pighizzini, G., Sannella, D.T. (eds.) MFCS 2015. LNCS, vol. 9235, pp. 62\u201374. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48054-0_6"},{"key":"31_CR6","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1016\/j.tcs.2016.07.003","volume":"645","author":"R Bauer","year":"2016","unstructured":"Bauer, R., Columbus, T., Rutter, I., Wagner, D.: Search-space size in contraction hierarchies. Theor. Comput. Sci. 645, 112\u2013127 (2016). https:\/\/doi.org\/10.1016\/j.tcs.2016.07.003","journal-title":"Theor. Comput. Sci."},{"key":"31_CR7","doi-asserted-by":"publisher","unstructured":"Blum, J., Storandt, S.: Lower bounds and approximation algorithms for search space sizes in contraction hierarchies. In: Grandoni, F., Herman, G., Sanders, P. (eds.) Proceedings of the 28th Annual European Symposium on Algorithms (ESA 2020). LIPIcs, vol. 173, pp. 20:1\u201320:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020). https:\/\/doi.org\/10.4230\/LIPIcs.ESA.2020.20","DOI":"10.4230\/LIPIcs.ESA.2020.20"},{"key":"31_CR8","doi-asserted-by":"publisher","unstructured":"Chen, Z., Fu, A.W., Jiang, M., Lo, E., Zhang, P.: P2H: efficient distance querying on road networks by projected vertex separators. In: Li, G., Li, Z., Idreos, S., Srivastava, D. (eds.) Proceedings of the 2021 International Conference on Management of Data (SIGMOD 2021), pp. 313\u2013325. ACM (2021). https:\/\/doi.org\/10.1145\/3448016.3459245","DOI":"10.1145\/3448016.3459245"},{"issue":"5","key":"31_CR9","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.: Reachability and distance queries via 2-hop labels. SIAM J. Comput. 32(5), 1338\u20131355 (2003). https:\/\/doi.org\/10.1137\/S0097539702403098","journal-title":"SIAM J. Comput."},{"issue":"1","key":"31_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3299901","volume":"24","author":"G D\u2019angelo","year":"2019","unstructured":"D\u2019angelo, G., D\u2019emidio, M., Frigioni, D.: Fully dynamic 2-hop cover labeling. ACM J. Exp. Algorithmics 24(1), 1\u201336 (2019). https:\/\/doi.org\/10.1145\/3299901","journal-title":"ACM J. Exp. Algorithmics"},{"key":"31_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/978-3-642-20662-7_32","volume-title":"Experimental Algorithms","author":"D Delling","year":"2011","unstructured":"Delling, D., Goldberg, A.V., Pajor, T., Werneck, R.F.: Customizable route planning. In: Pardalos, P.M., Rebennack, S. (eds.) SEA 2011. LNCS, vol. 6630, pp. 376\u2013387. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20662-7_32"},{"key":"31_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/978-3-662-44777-2_27","volume-title":"Algorithms - ESA 2014","author":"D Delling","year":"2014","unstructured":"Delling, D., Goldberg, A.V., Pajor, T., Werneck, R.F.: Robust distance queries on massive networks. In: Schulz, A.S., Wagner, D. (eds.) ESA 2014. LNCS, vol. 8737, pp. 321\u2013333. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44777-2_27"},{"key":"31_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/978-3-319-07959-2_22","volume-title":"Experimental Algorithms","author":"D Delling","year":"2014","unstructured":"Delling, D., Goldberg, A.V., Savchenko, R., Werneck, R.F.: Hub labels: theory and practice. In: Gudmundsson, J., Katajainen, J. (eds.) SEA 2014. LNCS, vol. 8504, pp. 259\u2013270. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-07959-2_22"},{"key":"31_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/978-3-642-38527-8_4","volume-title":"Experimental Algorithms","author":"D Delling","year":"2013","unstructured":"Delling, D., Goldberg, A.V., Werneck, R.F.: Hub label compression. In: Bonifaci, V., Demetrescu, C., Marchetti-Spaccamela, A. (eds.) SEA 2013. LNCS, vol. 7933, pp. 18\u201329. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38527-8_4"},{"issue":"1","key":"31_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2886843","volume":"21","author":"J Dibbelt","year":"2016","unstructured":"Dibbelt, J., Strasser, B., Wagner, D.: Customizable contraction hierarchies. ACM J. Exp. Algorithmics 21(1), 1\u201349 (2016). https:\/\/doi.org\/10.1145\/2886843","journal-title":"ACM J. Exp. Algorithmics"},{"key":"31_CR16","doi-asserted-by":"publisher","unstructured":"Farhan, M., Wang, Q.: Efficient maintenance of distance labelling for incremental updates in large dynamic graphs. In: Velegrakis, Y., Zeinalipour-Yazti, D., Chrysanthis, P.K., Guerra, F. (eds.) Proceedings of the 24th International Conference on Extending Database Technology (EDBT 2021), pp. 385\u2013390. OpenProceedings.org (2021). https:\/\/doi.org\/10.5441\/002\/edbt.2021.39","DOI":"10.5441\/002\/edbt.2021.39"},{"key":"31_CR17","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/s00778-021-00707-z","volume":"31","author":"M Farhan","year":"2021","unstructured":"Farhan, M., Wang, Q., Lin, Yu., McKay, B.: Fast fully dynamic labelling for distance queries. VLDB J. 31, 483\u2013506 (2021). https:\/\/doi.org\/10.1007\/s00778-021-00707-z","journal-title":"VLDB J."},{"key":"31_CR18","doi-asserted-by":"publisher","unstructured":"Feige, U., Mahdian, M.: Finding small balanced separators. In: Kleinberg, J.M. (ed.) Proceedings of the 38th Annual ACM Symposium on Theory of Computing (STOC 2006), pp. 375\u2013384. ACM (2006). https:\/\/doi.org\/10.1145\/1132516.1132573","DOI":"10.1145\/1132516.1132573"},{"issue":"3","key":"31_CR19","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.: Exact routing in large road networks using contraction hierarchies. Transp. Sci. 46(3), 388\u2013404 (2012). https:\/\/doi.org\/10.1287\/trsc.1110.0401","journal-title":"Transp. Sci."},{"key":"31_CR20","doi-asserted-by":"publisher","unstructured":"Leighton, F.T., Rao, S.: An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms. In: Proceedings of the 29th Annual Symposium on Foundations of Computer Science (FOCS 1988), pp. 422\u2013431. IEEE Computer Society (1988). https:\/\/doi.org\/10.1109\/SFCS.1988.21958","DOI":"10.1109\/SFCS.1988.21958"},{"key":"31_CR21","doi-asserted-by":"publisher","unstructured":"Ouyang, D., Qin, L., Chang, L., Lin, X., Zhang, Y., Zhu, Q.: When hierarchy meets 2-hop-labeling: efficient shortest distance queries on road networks. In: Das, G., Jermaine, C.M., Bernstein, P.A. (eds.) Proceedings of the 2018 International Conference on Management of Data (SIGMOD 2018), pp. 709\u2013724. ACM (2018). https:\/\/doi.org\/10.1145\/3183713.3196913","DOI":"10.1145\/3183713.3196913"},{"issue":"6","key":"31_CR22","doi-asserted-by":"publisher","first-page":"164","DOI":"10.3390\/a14060164","volume":"14","author":"T Rupp","year":"2021","unstructured":"Rupp, T., Funke, S.: A lower bound for the query phase of contraction hierarchies and hub labels and a provably optimal instance-based schema. Algorithms 14(6), 164 (2021). https:\/\/doi.org\/10.3390\/a14060164","journal-title":"Algorithms"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-22105-7_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,30]],"date-time":"2023-03-30T22:05:25Z","timestamp":1680213925000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22105-7_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031221040","9783031221057"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22105-7_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shenzhen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 October 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 October 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cocoon-conference.org\/2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"101","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"39","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"12","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"39% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}