{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T22:50:55Z","timestamp":1743115855488,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031630200"},{"type":"electronic","value":"9783031630217"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-63021-7_34","type":"book-chapter","created":{"date-parts":[[2024,6,21]],"date-time":"2024-06-21T13:02:29Z","timestamp":1718974949000},"page":"446-459","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Parameterized Upper Bounds for Path-Consistent Hub Labeling"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Funke","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":[[2024,6,22]]},"reference":[{"key":"34_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"690","DOI":"10.1007\/978-3-642-22006-7_58","volume-title":"Automata, Languages and Programming","author":"I Abraham","year":"2011","unstructured":"Abraham, I., Delling, D., Fiat, A., Goldberg, A.V., Werneck, R.F.: VC-dimension and shortest path algorithms. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011. LNCS, vol. 6755, pp. 690\u2013699. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22006-7_58"},{"issue":"5","key":"34_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2985473","volume":"63","author":"I Abraham","year":"2016","unstructured":"Abraham, I., Delling, D., Fiat, A., Goldberg, A.V., Werneck, R.F.: Highway dimension and provably efficient shortest path algorithms. J. ACM (JACM) 63(5), 1\u201326 (2016)","journal-title":"J. ACM (JACM)"},{"key":"34_CR3","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":"34_CR4","doi-asserted-by":"crossref","unstructured":"Angelidakis, H., Makarychev, Y., Oparin, V.: Algorithmic and hardness results for the hub labeling problem. In: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1442\u20131461. SIAM, Society for Industrial and Applied Mathematics (2017)","DOI":"10.1137\/1.9781611974782.94"},{"key":"34_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":"34_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/978-3-642-13073-1_32","volume-title":"Algorithms and Complexity","author":"R Bauer","year":"2010","unstructured":"Bauer, R., Columbus, T., Katz, B., Krug, M., Wagner, D.: Preprocessing speed-up techniques is hard. In: Calamoneri, T., Diaz, J. (eds.) CIAC 2010. LNCS, vol. 6078, pp. 359\u2013370. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13073-1_32"},{"key":"34_CR7","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)","journal-title":"Theor. Comput. Sci."},{"key":"34_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/978-3-319-94776-1_20","volume-title":"Computing and Combinatorics","author":"J Blum","year":"2018","unstructured":"Blum, J., Storandt, S.: Computation and growth of road network dimensions. In: Wang, L., Zhu, D. (eds.) COCOON 2018. LNCS, vol. 10976, pp. 230\u2013241. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-94776-1_20"},{"issue":"5","key":"34_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)","journal-title":"SIAM J. Comput."},{"key":"34_CR10","doi-asserted-by":"crossref","unstructured":"Delling, D., Goldberg, A.V., Pajor, T., Werneck, R.F.: Robust exact distance queries on massive networks. Microsoft Research, USA, Technical report, vol. 2 (2014)","DOI":"10.1007\/978-3-662-44777-2_27"},{"key":"34_CR11","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":"34_CR12","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"},{"key":"34_CR13","doi-asserted-by":"crossref","unstructured":"Hershberger, J., Suri, S.: Vickrey prices and shortest paths: what is an edge worth? In: Proceedings 42nd IEEE Symposium on Foundations of Computer Science, pp. 252\u2013259. IEEE (2001)","DOI":"10.1109\/SFCS.2001.959899"},{"key":"34_CR14","doi-asserted-by":"crossref","unstructured":"Kosowski, A., Viennot, L.: Beyond highway dimension: small distance labels using tree skeletons. In: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1462\u20131478. SIAM (2017)","DOI":"10.1137\/1.9781611974782.95"},{"key":"34_CR15","doi-asserted-by":"crossref","unstructured":"Lakhotia, K., Dong, Q., Kannan, R., Prasanna, V.: Planting trees for scalable and efficient canonical hub labeling (2019). arXiv preprint arXiv:1907.00140","DOI":"10.14778\/3372716.3372722"},{"key":"34_CR16","volume":"413","author":"P Manuel","year":"2022","unstructured":"Manuel, P., Bre\u0161ar, B., Klav\u017ear, S.: The geodesic-transversal problem. Appl. Math. Comput. 413, 126621 (2022)","journal-title":"Appl. Math. Comput."},{"key":"34_CR17","unstructured":"Storandt, S.: Algorithms for landmark hub labeling. In: 33rd International Symposium on Algorithms and Computation (ISAAC 2022). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2022)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-63021-7_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,21]],"date-time":"2024-06-21T13:17:53Z","timestamp":1718975873000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-63021-7_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031630200","9783031630217"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-63021-7_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"22 June 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ischia","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 July 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 July 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"35","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/iwoca2024.di.unisa.it","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}