{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T18:12:04Z","timestamp":1787508724942,"version":"build-2736575974"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662534250","type":"print"},{"value":"9783662534267","type":"electronic"}],"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":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-53426-7_17","type":"book-chapter","created":{"date-parts":[[2016,9,3]],"date-time":"2016-09-03T04:49:15Z","timestamp":1472878155000},"page":"230-242","source":"Crossref","is-referenced-by-count":4,"title":["Sublinear-Space Distance Labeling Using Hubs"],"prefix":"10.1007","author":[{"given":"Pawe\u0142","family":"Gawrychowski","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Adrian","family":"Kosowski","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Przemys\u0142aw","family":"Uzna\u0144ski","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,9,4]]},"reference":[{"key":"17_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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)"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Abraham, I., Fiat, A., Goldberg, A.V., Werneck, R.F.: Highway dimension, shortest paths, and provably efficient algorithms. In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010, Austin, Texas, USA, January 17-19, pp. 782\u2013793 (2010). http:\/\/dx.doi.org\/10.1137\/1.9781611973075.64","DOI":"10.1137\/1.9781611973075.64"},{"key":"17_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"404","DOI":"10.1007\/978-3-642-24100-0_39","volume-title":"Distributed Computing","author":"I Abraham","year":"2011","unstructured":"Abraham, I., Gavoille, C.: On approximate distance labels and routing schemes with affine stretch. In: Peleg, D. (ed.) Distributed Computing. LNCS, vol. 6950, pp. 404\u2013415. Springer, Heidelberg (2011)"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Agarwal, R., Godfrey, P.B.: Distance oracles for stretch less than 2. In: Khanna, S., (ed.) Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2013), New Orleans, Louisiana, USA, 6\u20138 January 2013, pp. 526\u2013538. SIAM (2013)","DOI":"10.1137\/1.9781611973105.38"},{"key":"17_CR5","doi-asserted-by":"crossref","DOI":"10.1002\/0471722154","volume-title":"The Probabilistic Method","author":"N Alon","year":"2000","unstructured":"Alon, N., Spencer, J.H.: The Probabilistic Method, 2nd edn. Wiley, New York (2000)","edition":"2"},{"key":"17_CR6","unstructured":"Alstrup, S., Dahlgaard, S., Knudsen, M.B.T., Porat, E.: Sublinear distance labeling for sparse graphs. CoRR, abs\/1507.02618 (2015)"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"Alstrup, S., Gavoille, C., Halvorsen, E.B., Petersen, H.: Simpler, faster and shorter labels for distances in graphs. In: Krauthgamer, R., (ed) Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2016), Arlington, VA, USA, 10\u201312 January 2016, pp. 338\u2013350. SIAM (2016)","DOI":"10.1137\/1.9781611974331.ch25"},{"key":"17_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/978-3-642-39206-1_7","volume-title":"Automata, Languages, and Programming","author":"M Babenko","year":"2013","unstructured":"Babenko, M., Goldberg, A.V., Gupta, A., Nagarajan, V.: Algorithms for hub label optimization. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013, Part I. LNCS, vol. 7965, pp. 69\u201380. Springer, Heidelberg (2013)"},{"key":"17_CR9","first-page":"4: 2.4-4","volume":"14","author":"R Bauer","year":"2010","unstructured":"Bauer, R., Delling, D.: SHARC: fast and robust unidirectional routing. J. Exp. Algorithmics 14, 4: 2.4-4\u20134: 2.29 (2010)","journal-title":"J. Exp. Algorithmics"},{"issue":"4","key":"17_CR10","doi-asserted-by":"crossref","first-page":"1029","DOI":"10.1137\/S0895480103431046","volume":"19","author":"B Bollob\u00e1s","year":"2005","unstructured":"Bollob\u00e1s, B., Coppersmith, D., Elkin, M.: Sparse distance preservers and additive spanners. SIAM J. Discrete Math. 19(4), 1029\u20131055 (2005)","journal-title":"SIAM J. Discrete Math."},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"Chechik, S.: Approximate distance oracles with constant query time. In: Proceedings of the 46th Annual ACM Symposium on Theory of Computing (STOC 2014), pp. 654\u2013663, New York, NY, USA. ACM (2014)","DOI":"10.1145\/2591796.2591801"},{"issue":"3\u20134","key":"17_CR12","doi-asserted-by":"crossref","first-page":"713","DOI":"10.1007\/s00453-010-9478-x","volume":"62","author":"V Chepoi","year":"2012","unstructured":"Chepoi, V., Dragan, F.F., Estellon, B., Habib, M., Vax\u00e8s, Y., Xiang, Y.: Additive spanners and distance and routing labeling schemes for hyperbolic graphs. Algorithmica 62(3\u20134), 713\u2013732 (2012)","journal-title":"Algorithmica"},{"issue":"5","key":"17_CR13","doi-asserted-by":"crossref","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":"17_CR14","unstructured":"Cohen, H., Porat, E.: On the hardness of distance oracle for sparse graph. CoRR, abs\/1006.1117 (2010)"},{"issue":"2","key":"17_CR15","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1109\/TIT.1975.1055349","volume":"21","author":"P Elias","year":"1975","unstructured":"Elias, P.: Universal codeword sets and representations of the integers. IEEE Trans. Inf. Theory 21(2), 194\u2013203 (1975)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"17_CR16","doi-asserted-by":"crossref","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.: Distance labeling in graphs. J. Algorithms 53(1), 85\u2013112 (2004)","journal-title":"J. Algorithms"},{"key":"17_CR17","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/BFb0067362","volume-title":"Graph Theory and Applications","author":"R Graham","year":"1972","unstructured":"Graham, R., Pollak, H.: On embedding graphs in squashed cubes. In: Alavi, Y., Lick, D., White, A. (eds.) Graph Theory and Applications. Lecture Notes in Mathematics, vol. 303, pp. 99\u2013110. Springer, Berlin Heidelberg (1972)"},{"key":"17_CR18","unstructured":"K\u00f6hler, E., M\u00f6hring, R.H., Schilling, H.: Fast point-to-point shortest path computations with arc-flags. In: 9th DIMACS Implementation Challenge (2006)"},{"key":"17_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1007\/978-3-540-69068-9_17","volume-title":"Combinatorial Pattern Matching","author":"I Nitto","year":"2008","unstructured":"Nitto, I., Venturini, R.: On compact representations of all-pairs-shortest-path-distance matrices. In: Ferragina, P., Landau, G.M. (eds.) CPM 2008. LNCS, vol. 5029, pp. 166\u2013177. Springer, Heidelberg (2008)"},{"key":"17_CR20","doi-asserted-by":"crossref","unstructured":"P\u0103tra\u015fcu, M.: Succincter. In: 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 25\u201328 October 2008, Philadelphia, PA, USA, pp. 305\u2013313. IEEE Computer Society (2008)","DOI":"10.1109\/FOCS.2008.83"},{"issue":"1","key":"17_CR21","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1137\/11084128X","volume":"43","author":"M P\u0103tra\u015fcu","year":"2014","unstructured":"P\u0103tra\u015fcu, M., Roditty, L.: Distance oracles beyond the Thorup-Zwick bound. SIAM J. Comput. 43(1), 300\u2013311 (2014)","journal-title":"SIAM J. Comput."},{"key":"17_CR22","first-page":"1","volume-title":"Encyclopedia of Algorithms","author":"L Roditty","year":"2014","unstructured":"Roditty, L.: Distance oracles for sparse graphs. In: Kao, M.-Y. (ed.) Encyclopedia of Algorithms, pp. 1\u20133. Springer, New York (2014)"},{"key":"17_CR23","doi-asserted-by":"crossref","unstructured":"Sommer, C., Verbin, E., Yu, W.: Distance oracles for sparse graphs. In: 50th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 703\u2013712. IEEE (2009)","DOI":"10.1109\/FOCS.2009.27"},{"key":"17_CR24","doi-asserted-by":"crossref","unstructured":"Thorup, M., Zwick, U.: Compact routing schemes. In: Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA 2001), pp. 1\u201310, New York, NY, USA. ACM (2001)","DOI":"10.1145\/378580.378581"},{"issue":"14","key":"17_CR25","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1016\/j.ipl.2011.04.006","volume":"111","author":"O Weimann","year":"2011","unstructured":"Weimann, O., Peleg, D.: A note on exact distance labeling. Inf. Process. Lett. 111(14), 671\u2013673 (2011)","journal-title":"Inf. Process. Lett."},{"key":"17_CR26","doi-asserted-by":"crossref","unstructured":"Wulff-Nilsen, C.: Approximate distance oracles with improved query time. In: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 539\u2013549 (2013)","DOI":"10.1137\/1.9781611973105.39"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-53426-7_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,13]],"date-time":"2019-09-13T01:47:45Z","timestamp":1568339265000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-53426-7_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662534250","9783662534267"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-53426-7_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}