{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:32:01Z","timestamp":1725489121513},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540430094"},{"type":"electronic","value":"9783540453079"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45307-5_3","type":"book-chapter","created":{"date-parts":[[2007,8,16]],"date-time":"2007-08-16T07:10:12Z","timestamp":1187248212000},"page":"24-35","source":"Crossref","is-referenced-by-count":0,"title":["Compact Routing in Directed Networks with Stretch Factor of Two"],"prefix":"10.1007","author":[{"given":"Punit","family":"Chandra","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ajay D.","family":"Kshemkalyani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,12,4]]},"reference":[{"key":"3_CR1","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/0196-6774(90)90017-9","volume":"11","author":"B. Awerbuch","year":"1990","unstructured":"Awerbuch, B., Bar-Noy, A., Linial, N., Peleg, D.: Improved routing strategies withsuccinct tables. Journal of Algorithms 11 (1990) 307\u2013341","journal-title":"Journal of Algorithms"},{"key":"3_CR2","unstructured":"Cowen, L. J.: Compact routing with minimum stretch. In Proceedings of the 10thAnnual ACM-SIAM Symposium on Discrete Algorithms (1999) 255\u2013260"},{"key":"3_CR3","unstructured":"Cowen, L. J., Wagner, C. G.: Compact roundtrip routing in directed networks.In Proceedings of the 19th Annual ACM Symposium on Principles of DistributedComputing (2000) 51\u201359"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Fraigniaud, P., Gavoille, C.: Memory requirement for universal routing schemes.In Proceedings of the 14th Annual ACM Symposium on Principles of Distributed Computing (1995) 223\u2013230","DOI":"10.1145\/224964.224989"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Gavoille, C., Perennes, S.: Memory requirement for routing in distributed networks.In Proceedings of the 15th Annual ACM Symposium on Principles of Distributed Computing (1996) 125\u2013133","DOI":"10.1145\/248052.248075"},{"key":"3_CR6","unstructured":"Gavoille, C., Gengler, M.: Space-efficiency of routing schemes of stretch factorthree. In Proceedings of the 4th International Colloquium on Structural Informationand Communication Complexity (1997)"},{"key":"3_CR7","unstructured":"Gavoille, C., Peleg, D.: Compact routing scheme with low stretch factor. In Proceedingsof the 17th Annual ACM Symposium on Principles of Distributed Computing(1998) 11\u201320"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Iwama, I., Kawachi, A.: Compact routing with stretch factor of less than three.In Proceedings of the 19th Annual ACM Symposium on Principles of Distributed Computing (2000) 337","DOI":"10.1145\/343477.362158"},{"key":"3_CR9","first-page":"256","volume-title":"The Book of L","author":"J Leeuwen van","year":"1986","unstructured":"Leeuwen,J. van, Tan, R.: Routing with compact routing tables. InG. Roznenbergand A. Salomaa, editors, The Book of L. Springer-Verlag, New York, New York(1986) 256\u2013273"},{"key":"3_CR10","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1093\/comjnl\/30.4.298","volume":"30","author":"J Leeuwen van","year":"1987","unstructured":"Leeuwen,J. van, Tan, R.: Interval routing. The Computer Journal 30 (1987) 259\u2013273","journal-title":"The Computer Journal"},{"key":"3_CR11","unstructured":"Peleg, D., Upfal, E.: A tradeoff between size and efficiency for routing tables. InProceedings of the 20th Annual ACM Symposium on Theory of Computing (1988)43\u201352"},{"key":"3_CR12","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1145\/65950.65953","volume":"36","author":"D. Peleg","year":"1989","unstructured":"Peleg, D., Upfal, E.: A tradeoff between size and efficiency for routing tables.Journal of the ACM 36 (1989) 510\u2013530","journal-title":"Journal of the ACM"},{"key":"3_CR13","volume-title":"An overview of locality-sensitive distributed computing","author":"D. Peleg","year":"1997","unstructured":"Peleg, D.: An overview of locality-sensitive distributed computing. UnpublishedMonograph, The Weizmann Institute, Rehovot, Israel, 1997"},{"key":"3_CR14","first-page":"5","volume":"28","author":"N. Santoro","year":"1985","unstructured":"Santoro, N., Khatib, R.: Implicit routing in networks. The Computer Science Journal 28 (1985) 5\u20138","journal-title":"The Computer Science Journal"}],"container-title":["Lecture Notes in Computer Science","High Performance Computing \u2014 HiPC 2001"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45307-5_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T00:28:48Z","timestamp":1556756928000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45307-5_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540430094","9783540453079"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-45307-5_3","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}