{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:14:17Z","timestamp":1763468057702},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642240997"},{"type":"electronic","value":"9783642241000"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-24100-0_39","type":"book-chapter","created":{"date-parts":[[2011,10,19]],"date-time":"2011-10-19T06:20:40Z","timestamp":1319005240000},"page":"404-415","source":"Crossref","is-referenced-by-count":15,"title":["On Approximate Distance Labels and Routing Schemes with Affine Stretch"],"prefix":"10.1007","author":[{"given":"Ittai","family":"Abraham","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cyril","family":"Gavoille","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Abraham, I., Gavoille, C., Malkhi, D., Nisan, N., Thorup, M.: Compact name-independent routing with minimum stretch. ACM Trans. on Algo.\u00a03 (2008)","key":"39_CR1","DOI":"10.1145\/1367064.1367077"},{"doi-asserted-by":"crossref","unstructured":"Aingworth, D., Chekuri, C., Indyk, P., Motwani, R.: Fast estimation of diameter and shortest paths (without matrix multiplication). SIAM J. on Comp.\u00a028 (1999)","key":"39_CR2","DOI":"10.1137\/S0097539796303421"},{"key":"39_CR3","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/BF02189308","volume":"9","author":"I. Alth\u00f6fer","year":"1993","unstructured":"Alth\u00f6fer, I., Das, G., Dobkin, D.P., Joseph, D.A., Soares, J.: On sparse spanners of weighted graphs. Discr. & Comp. Geom.\u00a09, 81 (1993)","journal-title":"Discr. & Comp. Geom."},{"key":"39_CR4","first-page":"503","volume-title":"FOCS","author":"B. Awerbuch","year":"1990","unstructured":"Awerbuch, B., Peleg, D.: Sparse partitions. In: FOCS, p. 503. IEEE Press, Los Alamitos (1990)"},{"doi-asserted-by":"crossref","unstructured":"Baswana, S., Kavitha, T., Mehlhorn, K., Pettie, S.: Additive spanners and (\u03b1,\u03b2)-spanners. ACM Trans. on Algo.\u00a07, A.5 (2010)","key":"39_CR5","DOI":"10.1145\/1868237.1868242"},{"key":"39_CR6","first-page":"323","volume":"1","author":"M. Elkin","year":"2005","unstructured":"Elkin, M.: Computing almost shortest paths. ACM Trans. on Algo.\u00a01, 323 (2005)","journal-title":"ACM Trans. on Algo."},{"key":"39_CR7","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1137\/S0097539701393384","volume":"33","author":"M. Elkin","year":"2004","unstructured":"Elkin, M., Peleg, D.: (1\u2009+\u2009\u03b5,\u03b2)-spanner constructions for general graphs. SIAM J. on Comp.\u00a033, 608 (2004)","journal-title":"SIAM J. on Comp."},{"key":"39_CR8","first-page":"29","volume-title":"Extremal problems in graph theory","author":"P. Erd\u00f6s","year":"1964","unstructured":"Erd\u00f6s, P.: Extremal problems in graph theory, p. 29. Publ. House Cszechoslovak Acad. Sci., Prague (1964)"},{"key":"39_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1007\/3-540-48224-5_62","volume-title":"Automata, Languages and Programming","author":"P. Fraigniaud","year":"2001","unstructured":"Fraigniaud, P., Gavoille, C.: Routing in trees. In: Yu, Y., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol.\u00a02076, pp. 757\u2013772. Springer, Heidelberg (2001)"},{"key":"39_CR10","first-page":"225","volume-title":"SPAA","author":"C. Gavoille","year":"2011","unstructured":"Gavoille, C., Sommer, C.: Sparse spanners vs. compact routing. In: SPAA, p. 225. ACM Press, New York (2011)"},{"key":"39_CR11","first-page":"155","volume":"1","author":"L. Kleinrock","year":"1977","unstructured":"Kleinrock, L., Kamoun, F.: Hierarchical routing for large networks; performance evaluation and optimization. Computer Networks\u00a01, 155 (1977)","journal-title":"Computer Networks"},{"key":"39_CR12","first-page":"109","volume-title":"FOCS","author":"M. Mendel","year":"2006","unstructured":"Mendel, M., Naor, A.: Ramsey partitions and proximity data structures. In: FOCS, p. 109. IEEE Comp. Soc. Press, Los Alamitos (2006)"},{"key":"39_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/978-3-540-73420-8_9","volume-title":"Automata, Languages and Programming","author":"S. Pettie","year":"2007","unstructured":"Pettie, S.: Low distortion spanners. In: Arge, L., Cachin, C., Jurdzi\u0144ski, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol.\u00a04596, pp. 78\u201389. Springer, Heidelberg (2007)"},{"key":"39_CR14","first-page":"815","volume-title":"FOCS","author":"M. P\u01cetra\u015fcu","year":"2010","unstructured":"P\u01cetra\u015fcu, M., Roditty, L.: Distance oracles beyond the Thorup-Zwick bound. In: FOCS, p. 815. IEEE Comp. Soc. Press, Los Alamitos (2010)"},{"key":"39_CR15","first-page":"703","volume-title":"FOCS","author":"C. Sommer","year":"2009","unstructured":"Sommer, C., Verbin, E., Yu, W.: Distance oracles for sparse graphs. In: FOCS, p. 703. IEEE Comp. Soc. Press, Los Alamitos (2009)"},{"key":"39_CR16","first-page":"1","volume-title":"SPAA","author":"M. Thorup","year":"2001","unstructured":"Thorup, M., Zwick, U.: Compact routing schemes. In: SPAA, p. 1. ACM Press, New York (2001)"},{"key":"39_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1044731.1044732","volume":"52","author":"M. Thorup","year":"2005","unstructured":"Thorup, M., Zwick, U.: Approximate distance oracles. J. ACM\u00a052, 1 (2005)","journal-title":"J. ACM"},{"doi-asserted-by":"crossref","unstructured":"Thorup, M., Zwick, U.: Spanners and emulators with sublinear distance errors. In: SODA, p.802. ACM-SIAM (2006)","key":"39_CR18","DOI":"10.1145\/1109557.1109645"},{"key":"39_CR19","first-page":"389","volume-title":"FOCS","author":"D.P. Woodruff","year":"2006","unstructured":"Woodruff, D.P.: Lower bounds for additive spanners, emulators, and more. In: FOCS, p. 389. IEEE Comp. Soc. Press, Los Alamitos (2006)"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-24100-0_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,18]],"date-time":"2019-06-18T02:47:36Z","timestamp":1560826056000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-24100-0_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642240997","9783642241000"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-24100-0_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}