{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T01:53:47Z","timestamp":1772502827958,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540422877","type":"print"},{"value":"9783540482246","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-48224-5_62","type":"book-chapter","created":{"date-parts":[[2007,10,28]],"date-time":"2007-10-28T06:29:04Z","timestamp":1193552944000},"page":"757-772","source":"Crossref","is-referenced-by-count":84,"title":["Routing in Trees"],"prefix":"10.1007","author":[{"given":"Pierre","family":"Fraigniaud","sequence":"first","affiliation":[]},{"given":"Cyril","family":"Gavoille","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,7,4]]},"reference":[{"key":"62_CR1","doi-asserted-by":"crossref","unstructured":"B. Awerbuch AND D. Peleg, Sparse partitions, in 31th Symposium on Foundations of Computer Science (FOCS), IEEE Computer Society Press, 1990, pp. 503\u2013513.","DOI":"10.1109\/FSCS.1990.89571"},{"key":"62_CR2","unstructured":"L. J. Cowen, Compact routing with minimum stretch, in 10th Symposium on Discrete Algorithms (SODA), ACM-SIAM, 1999, pp. 255\u2013260."},{"key":"62_CR3","doi-asserted-by":"crossref","unstructured":"T. Eilam, C. Gavoille, AND D. Peleg, Compact routing schemes with low stretch factor, in 17th Annual ACM Symposium on Principles of Distributed Computing (PODC), ACM PRESS, Aug. 1998, pp. 11\u201320.","DOI":"10.1145\/277697.277702"},{"key":"62_CR4","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/S0304-3975(99)00283-2","volume":"245","author":"C. Gavoille","year":"2000","unstructured":"C. Gavoille, A survey on interval routing, Theoretical Computer Science, 245 (2000), pp. 217\u2013253.","journal-title":"Theoretical Computer Science"},{"key":"62_CR5","doi-asserted-by":"crossref","unstructured":"C. Gavoille AND S. P\u00e9renn\u00e8s, Memory requirement for routing in distributed networks, in 15th Annual ACM Symposium on Principles of Distributed Computing (PODC), ACM PRESS, May 1996, pp. 125\u2013133.","DOI":"10.1145\/248052.248075"},{"key":"62_CR6","unstructured":"M. J. Hall, Combinatorial Theory (second edition), Wiley-Interscience Publication, 1986."},{"key":"62_CR7","unstructured":"J. I. Munro, Tables, in 16th FST&TCS, vol. 1180 of Lectures Notes in Computer Science, Springer-Verlag, 1996, pp. 37\u201342."},{"key":"62_CR8","doi-asserted-by":"crossref","unstructured":"J. I. Munro AND V. Raman, Succinct representation of balanced parentheses, static trees and planar graphs, in 38th Symposium on Foundations of Computer Science (FOCS), IEEE Computer Society Press, Oct. 1997, pp. 118\u2013126.","DOI":"10.1109\/SFCS.1997.646100"},{"key":"62_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/3-540-46784-X_5","volume-title":"25th International Workshop, Graph-Theoretic Concepts in Computer Science (WG)","author":"D. Peleg","year":"1999","unstructured":"D. Peleg, Proximity-preserving labeling schemes and their applications, in 25th International Workshop, Graph-Theoretic Concepts in Computer Science (WG), vol. 1665 of Lecture Notes in Computer Science, Springer, June 1999, pp. 30\u201341."},{"key":"62_CR10","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1145\/65950.65953","volume":"36","author":"D. Peleg","year":"1989","unstructured":"D. Peleg AND E. Upfal, A trade-off between space and efficiency for routing tables, Journal of the ACM, 36 (1989), pp. 510\u2013530.","journal-title":"Journal of the ACM"},{"key":"62_CR11","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1093\/comjnl\/28.1.5","volume":"28","author":"N. Santoro","year":"1985","unstructured":"N. Santoro AND R. Khatib, Labelling and implicit routing in networks, The Computer Journal, 28 (1985), pp. 5\u20138.","journal-title":"The Computer Journal"},{"key":"62_CR12","doi-asserted-by":"crossref","unstructured":"M. Thorup AND U. Zwick, Compact routing schemes, in 13th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), ACM PRESS, July 2001. To appear.","DOI":"10.1145\/378580.378581"},{"key":"62_CR13","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1093\/comjnl\/30.4.298","volume":"30","author":"J. v. Leeuwen","year":"1987","unstructured":"J. VAN Leeuwen AND R. B. Ttan, Interval routing, The Computer Journal, 30 (1987), pp. 298\u2013307.","journal-title":"The Computer Journal"},{"key":"62_CR14","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1006\/jnth.1993.1071","volume":"45","author":"R. Warlimont","year":"1993","unstructured":"R. Warlimont, Factorisatio numerorum with constraints, Journal of Number Theory, 45 (1993), pp. 186\u2013199.","journal-title":"Journal of Number Theory"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48224-5_62","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T23:49:48Z","timestamp":1737503388000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48224-5_62"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540422877","9783540482246"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-48224-5_62","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]}}}