{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:21:15Z","timestamp":1725549675521},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540281016"},{"type":"electronic","value":"9783540317111"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11534273_12","type":"book-chapter","created":{"date-parts":[[2010,3,12]],"date-time":"2010-03-12T13:31:47Z","timestamp":1268400707000},"page":"122-133","source":"Crossref","is-referenced-by-count":0,"title":["Max-stretch Reduction for Tree Spanners"],"prefix":"10.1007","author":[{"given":"Kazuo","family":"Iwama","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrzej","family":"Lingas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masaki","family":"Okita","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/978-3-540-30186-8_22","volume-title":"Distributed Computing","author":"I. Abraham","year":"2004","unstructured":"Abraham, I., Gavoille, C., Malkhi, D.: Routing with improved communication-space trade-off. In: Guerraoui, R. (ed.) DISC 2004. LNCS, vol.\u00a03274, pp. 305\u2013319. Springer, Heidelberg (2004)"},{"key":"12_CR2","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/BF02189308","volume":"9","author":"I. Alth\u00f6ffer","year":"1993","unstructured":"Alth\u00f6ffer, I., Das, G., Dobkin, D., Josepth, D., Soares, J.: On sparse spanners of weighted graphs. Discrete and Computational Geometry\u00a09, 81\u2013100 (1993)","journal-title":"Discrete and Computational Geometry"},{"unstructured":"Awerbuch, B., Baratz, A., Peleg, D.: Efficient Broadcast and Light-Weight Spanners. Technical Report CS92-22, The Weizmann Institute of Science, Rehovot, Israel (1992)","key":"12_CR3"},{"key":"12_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/3-540-40996-3_3","volume-title":"Algorithms and Computation","author":"P. Bose","year":"2000","unstructured":"Bose, P., Czyzowicz, J., Gasieniec, L., Kranakis, E., Krizanc, D., Pelc, A., Martin, M.V.: Strategies for hotlink assignments. In: Lee, D.T., Teng, S.-H. (eds.) ISAAC 2000. LNCS, vol.\u00a01969, pp. 23\u201334. Springer, Heidelberg (2000)"},{"key":"12_CR5","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/0166-218X(94)90073-6","volume":"48","author":"L. Cai","year":"1994","unstructured":"Cai, L.: Np-Completeness of Minimum Spanner Problems. Discrete Applied Mathematics\u00a048, 187\u2013194 (1994)","journal-title":"Discrete Applied Mathematics"},{"issue":"3","key":"12_CR6","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1137\/S0895480192237403","volume":"8","author":"L. Cai","year":"1995","unstructured":"Cai, L., Corneil, D.: Tree Spanners. SIAM Journal on Discrete Mathematics\u00a08(3), 359\u2013387 (1995)","journal-title":"SIAM Journal on Discrete Mathematics"},{"unstructured":"Emek, Y., Peleg, D.: Approximating Minimum Max-Stretch Spanning Trees on Unweighted Graphs. In: Proceedings of the 15 th Symposium on Discrete Algorithms (SODA) (January 2004)","key":"12_CR7"},{"doi-asserted-by":"crossref","unstructured":"Fekete, S.P., Kremer, J.: Tree spanners in planar graphs. Discrete Applicated Mathematics??108, 85???103 (2001);","key":"#cr-split#-12_CR8.1","DOI":"10.1016\/S0166-218X(00)00226-2"},{"unstructured":"Extended abstract version appears in the Proceedings of the 24th International Annual Workshop on Graph-Theoretic Concepts in Computer Science (WG 1998)","key":"#cr-split#-12_CR8.2"},{"key":"12_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: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol.\u00a02076, pp. 757\u2013772. Springer, Heidelberg (2001)"},{"unstructured":"Giannopoulos, P., Farshi, M., Gudmundsson, J.: Finding the best shortcut in a geometric network. In: Proceedings of 21st annual ACM Symposium on Computational Geometry (June 2005)","key":"12_CR10"},{"unstructured":"Nagamochi, H., Shiraki, T., Ibaraki, T.: Computing Edge-Connectivity Augmentation Function. In: Proceedings of the 8 th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 649\u2013658 (1997)","key":"12_CR11"},{"doi-asserted-by":"crossref","unstructured":"Peleg, D.: Proximity-Preserving Labeling Schemes and Their Applications. In: Proceedings of the 25 th International Workshop on Graph-Theoretic Concepts in Computer Science, Ascona, Switzerland, June 1999, pp. 30\u201341 (1999)","key":"12_CR12","DOI":"10.1007\/3-540-46784-X_5"},{"doi-asserted-by":"crossref","unstructured":"Peleg, D.: Distributed Computing: A Locality-Sensitive Approach. SIAM monographs on Discrete Mathematics and Applications (2000)","key":"12_CR13","DOI":"10.1137\/1.9780898719772"},{"doi-asserted-by":"crossref","unstructured":"Peleg, D., Ullman, J.: An Optimal Syncronizer for the Hypercube. In: Proceedings of the 6 th Annual ACM Symposium on Principles of Distributed Computing (PODC), Vancouver, pp. 77\u201385 (1987)","key":"12_CR14","DOI":"10.1145\/41840.41847"},{"doi-asserted-by":"crossref","unstructured":"Peleg, D., Upfal, E.: A Tradeoff between Space and Efficiency for Routing Tables. In: Proceedings of the 20 th ACM Symposium on Theory of Computing (STOC), May 1988, pp. 43\u201352 (1988)","key":"12_CR15","DOI":"10.1145\/62212.62217"},{"doi-asserted-by":"crossref","unstructured":"Thorup, M., Zwick, U.: Compact Routing Schemes. In: Proceedings of the 13 th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), May 2001, pp. 1\u201310 (2001)","key":"12_CR16","DOI":"10.1145\/378580.378581"},{"key":"12_CR17","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1093\/comjnl\/30.4.298","volume":"30","author":"J. Leeuwen van","year":"1987","unstructured":"van Leeuwen, J., Tan, R.B.: Interval Routing. The Computer Journal\u00a030, 298\u2013307 (1987)","journal-title":"The Computer Journal"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11534273_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:09:50Z","timestamp":1605643790000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11534273_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540281016","9783540317111"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/11534273_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}