{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,12,31]],"date-time":"2023-12-31T11:10:09Z","timestamp":1704021009755},"reference-count":21,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2000,8,1]],"date-time":"2000-08-01T00:00:00Z","timestamp":965088000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4733,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2000,8]]},"DOI":"10.1016\/s0304-3975(99)00284-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T14:08:42Z","timestamp":1027606122000},"page":"255-280","source":"Crossref","is-referenced-by-count":1,"title":["On the complexity of multi-dimensional interval routing schemes"],"prefix":"10.1016","volume":"245","author":[{"given":"Peter","family":"Ru\u017ei\u010dka","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"\u0160tefankovi\u010d","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(99)00284-4_BIB1","unstructured":"S.B. Akers, D. Harel, B. Krishnamurthy, The star graph: An attractive alternative to the n-cube, Proc. Internat. Conf. on Parallel Processing, 1987, pp. 393\u2013400."},{"key":"10.1016\/S0304-3975(99)00284-4_BIB2","unstructured":"H. Buhrman, J.-H Hoepman, P. Vit\u00e1nyi, Optimal routing tables, in: 15th Annual ACM Symp. of Distributed Computing (PODC\u201996), ACIM Press, 1988, pp. 11\u201320."},{"issue":"2","key":"10.1016\/S0304-3975(99)00284-4_BIB3","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1006\/jagm.1993.1013","article-title":"Edge separators of planar and outerplanar graphs with applications","volume":"14","author":"Diks","year":"1993","journal-title":"J. Algorithms"},{"key":"10.1016\/S0304-3975(99)00284-4_BIB4","doi-asserted-by":"crossref","unstructured":"T. Eilam, C. Gavoille, D. Peleg, Compact routing schemes with low stretch factor, LaBRI, Universit\u00e9 Bordeaux I, 33405 Talence Cedex, France, 1998.","DOI":"10.1145\/277697.277702"},{"key":"10.1016\/S0304-3975(99)00284-4_BIB5","doi-asserted-by":"crossref","unstructured":"M. Flammini, G. Gambosi, U. Nanni, R. Tan, Multi-dimensional interval routing schemes, Theoret. Comput. Sci. 205 (1998) 115\u2013133.","DOI":"10.1016\/S0304-3975(97)00070-4"},{"issue":"1","key":"10.1016\/S0304-3975(99)00284-4_BIB6","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1093\/comjnl\/41.1.16","article-title":"The complexity of interval routing on random graphs","volume":"41","author":"Flammini","year":"1998","journal-title":"Comput. J."},{"key":"10.1016\/S0304-3975(99)00284-4_BIB7","first-page":"785","article-title":"Optimal interval routing","volume":"Vol. 854","author":"Fraigniaud","year":"1994"},{"key":"10.1016\/S0304-3975(99)00284-4_BIB8","doi-asserted-by":"crossref","unstructured":"P. Fraigniaud, C. Gavoille, Local memory requirements of universal routing schemes, Proc. eighth Annual ACM Symp. on Parallel Algorithms and Architecture (SPAA), 1996.","DOI":"10.1145\/237502.237541"},{"key":"10.1016\/S0304-3975(99)00284-4_BIB9","unstructured":"C. Gavoille, Lower bounds for interval routing on bounded degree networks, Technical Report 1144-96, LaBRI, 1996."},{"key":"10.1016\/S0304-3975(99)00284-4_BIB10","first-page":"259","article-title":"On the Dilation of Interval Routing","volume":"Vol. 1295","author":"Gavoille","year":"1997"},{"key":"10.1016\/S0304-3975(99)00284-4_BIB11","doi-asserted-by":"crossref","unstructured":"C. Gavoille, S. Perennes, Memory requirement for routing in distributed networks, Proc. 15th Annual ACM Symp. on Principles of Distributed Computing (PODC\u201996), 1996, pp. 125\u2013133.","DOI":"10.1145\/248052.248075"},{"key":"10.1016\/S0304-3975(99)00284-4_BIB12","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0166-218X(89)90022-X","article-title":"On forwarding indices of networks","volume":"23","author":"Heydemann","year":"1989","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0304-3975(99)00284-4_BIB13","doi-asserted-by":"crossref","unstructured":"R. Kr\u00e1\u013eovi\u010d, P. Ru\u017ei\u010dka, D. \u0160tefankovi\u010d, The complexity of shortest path and dilation bounded interval routing, in: 3rd Euro-Par, Lecture Notes in Computer Science, Vol. 1300, Springer, Berlin (1997), pp. 258\u2013265. The full version will appear in TCS.","DOI":"10.1007\/BFb0002742"},{"key":"10.1016\/S0304-3975(99)00284-4_BIB14","first-page":"529","article-title":"Lower bounds for compact routing","volume":"Vol. 1046","author":"Kranakis","year":"1996"},{"issue":"2","key":"10.1016\/S0304-3975(99)00284-4_BIB15","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1093\/comjnl\/39.2.133","article-title":"On multi-label linear interval routing schemes","volume":"39","author":"Kranakis","year":"1996","journal-title":"Comput. J."},{"key":"10.1016\/S0304-3975(99)00284-4_BIB16","volume":"30","author":"van Leeuwen","year":"1987","journal-title":"Interval routing Comput. J."},{"key":"10.1016\/S0304-3975(99)00284-4_BIB17","doi-asserted-by":"crossref","unstructured":"J. van Leeuwen, R.B. Tan, Compact routing methods: a survey, in: Colloquium on Structural Information and Communication Complexity (SICC 94), Proc. School of Computer Science, Carleton University, Ottawa, 1994, pp. 99\u2013109.","DOI":"10.1515\/9780773591158-007"},{"key":"10.1016\/S0304-3975(99)00284-4_BIB18","series-title":"An Introduction to Kolmogorov Complexity and its Applications","author":"Li","year":"1993"},{"key":"10.1016\/S0304-3975(99)00284-4_BIB19","unstructured":"D. May, P. Thompson, Transputers and routers: Components for concurrent machines, INMOS, Ltd., 1991."},{"key":"10.1016\/S0304-3975(99)00284-4_BIB20","series-title":"Randomized Algorithms","author":"Motwani","year":"1995"},{"key":"10.1016\/S0304-3975(99)00284-4_BIB21","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1093\/comjnl\/28.1.5","article-title":"Labelling and implicit routing in networks","volume":"28","author":"Santoro","year":"1985","journal-title":"Comput. J."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599002844?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599002844?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,12,31]],"date-time":"2023-12-31T10:48:39Z","timestamp":1704019719000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397599002844"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,8]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2000,8]]}},"alternative-id":["S0304397599002844"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(99)00284-4","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2000,8]]}}}