{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,12,31]],"date-time":"2023-12-31T10:40:21Z","timestamp":1704019221848},"reference-count":23,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2000,3,1]],"date-time":"2000-03-01T00:00:00Z","timestamp":951868800000},"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":4886,"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,3]]},"DOI":"10.1016\/s0304-3975(98)00042-5","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T14:01:24Z","timestamp":1027605684000},"page":"85-107","source":"Crossref","is-referenced-by-count":8,"title":["The complexity of shortest path and dilation bounded interval routing"],"prefix":"10.1016","volume":"234","author":[{"given":"Rastislav","family":"Kr\u00e1\u013eovi\u010d","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Ru\u017ei\u010dka","sequence":"additional","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(98)00042-5_BIB1","unstructured":"S.B. Akers, D. Harel, B. Krishnamurthy, The star graph: an attractive alternative to the n-cube. in: Proc. Internat. Conf. on Parallel Processing, 1987, pp. 393\u2013400."},{"issue":"2","key":"10.1016\/S0304-3975(98)00042-5_BIB2","first-page":"45","article-title":"Linear interval routing schemes","volume":"2","author":"Bakker","year":"1991","journal-title":"Algorithms Rev."},{"key":"10.1016\/S0304-3975(98)00042-5_BIB3","first-page":"191","article-title":"A lower bound for linear interval routing","volume":"vol. 1151","author":"Eilam","year":"1996"},{"key":"10.1016\/S0304-3975(98)00042-5_BIB4","first-page":"37","article-title":"The complexity of interval routing on random graphs","volume":"vol. 969","author":"Flammini","year":"1995"},{"key":"10.1016\/S0304-3975(98)00042-5_BIB5","doi-asserted-by":"crossref","unstructured":"M. Flammini, E. Nardelli, On the path length in interval routing schemes, Manuscript, 1997.","DOI":"10.1007\/BFb0023472"},{"key":"10.1016\/S0304-3975(98)00042-5_BIB6","unstructured":"P. Fraigniaud, C. Gavoille, Interval routing schemes, Research Report 94-04, LIP, \u00c9cole Normale Sup\u00e9rieure de Lyon, 69364 Lyon Cedex 07, France, January 1994, Algorithmica, to appear."},{"key":"10.1016\/S0304-3975(98)00042-5_BIB7","first-page":"785","article-title":"Optimal interval routing","volume":"vol. 854","author":"Fraigniaud","year":"1994"},{"key":"10.1016\/S0304-3975(98)00042-5_BIB8","series-title":"8th Annual ACM Symp. on Parallel Algorithms and Architectures (SPAA)","article-title":"Local memory requirement of universal routing schemes","author":"Fraigniaud","year":"1996"},{"key":"10.1016\/S0304-3975(98)00042-5_BIB9","series-title":"Proc. SIROCCO\u201996","first-page":"88","article-title":"Lower bounds for interval routing on 3-regular networks","author":"Gavoille","year":"1996"},{"key":"10.1016\/S0304-3975(98)00042-5_BIB10","doi-asserted-by":"crossref","unstructured":"C. Gavoille, On the dilation of interval routing. Manuscript, accepted to MFCS\u201997, 1997.","DOI":"10.1007\/BFb0029969"},{"key":"10.1016\/S0304-3975(98)00042-5_BIB11","first-page":"338","article-title":"On multi-lable linear interval routing schemes","volume":"vol. 790","author":"Kranakis","year":"1994"},{"key":"10.1016\/S0304-3975(98)00042-5_BIB12","first-page":"529","article-title":"Lower bounds for compact routing","volume":"vol. 1046","author":"Kranakis","year":"1996"},{"key":"10.1016\/S0304-3975(98)00042-5_BIB13","unstructured":"D. May, P. Thompson, Transputers and Routers: Components for Concurrent Machines, Inmos, 1991."},{"key":"10.1016\/S0304-3975(98)00042-5_BIB14","doi-asserted-by":"crossref","unstructured":"F. Meyer auf der Heide, C. Scheideler, Deterministic routing with bounded buffers: turning offline into onlines protocols, Proc. 37th Symp. on Foundations of Computer Science (FOCS), November 1996.","DOI":"10.1109\/SFCS.1996.548496"},{"key":"10.1016\/S0304-3975(98)00042-5_BIB15","doi-asserted-by":"crossref","first-page":"510","DOI":"10.1145\/65950.65953","article-title":"A tradeoff between space and efficiency for routing tables","volume":"36","author":"Peleg","year":"1989","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(98)00042-5_BIB16","first-page":"492","article-title":"On the efficiency of interval routing algorithms","volume":"vol. 324","author":"Ru\u017ei\u010dka","year":"1988"},{"key":"10.1016\/S0304-3975(98)00042-5_BIB17","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."},{"issue":"1","key":"10.1016\/S0304-3975(98)00042-5_BIB18","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1002\/(SICI)1097-0037(199701)29:1<49::AID-NET5>3.0.CO;2-C","article-title":"A lower bound for interval routing in general networks","volume":"29","author":"Tse","year":"1997","journal-title":"Networks"},{"key":"10.1016\/S0304-3975(98)00042-5_BIB19","unstructured":"S.S.H. Tse, F.C.M. Lau, Lower bounds for multi-label interval routing, Proc. SIROCCO\u201995, Carleton Press, 1995, pp. 123\u2013134."},{"key":"10.1016\/S0304-3975(98)00042-5_BIB20","unstructured":"S.S.H. Tse, F.C.M. Lau, Two lower bounds for multi-label interval routing. Proc. Computing: The Australasian Theory Symp. (CATS\u201997), Sydney, Australia, February 1997."},{"key":"10.1016\/S0304-3975(98)00042-5_BIB21","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1093\/comjnl\/30.4.298","article-title":"Interval Routing","volume":"30","author":"van Leeuwen","year":"1987","journal-title":"Comput. J."},{"key":"10.1016\/S0304-3975(98)00042-5_BIB22","doi-asserted-by":"crossref","unstructured":"J. van Leeuwen, R.B. Tan, Compact routing methods: a survey, in: Proc. Colloquium on Structural Information and Communication Complexity (SICC). Carleton Press, 1995, pp. 99\u2013109.","DOI":"10.1515\/9780773591158-007"},{"key":"10.1016\/S0304-3975(98)00042-5_BIB23","unstructured":"J. Vounckx, G. Deconinck, R. Cuyvers, R. Lauwereins, J.A. Peperstraete, Network fault-tolerance with interval routing devices, in: Proc. 11th IASTED Internat. Symp. on Applied Informatics, Annecy, France, 1993, pp. 293\u2013296."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598000425?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598000425?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:05:09Z","timestamp":1704017109000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397598000425"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,3]]},"references-count":23,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2000,3]]}},"alternative-id":["S0304397598000425"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(98)00042-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2000,3]]}}}