{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:27:43Z","timestamp":1725456463469},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540634409"},{"type":"electronic","value":"9783540695493"}],"license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0002742","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T12:29:42Z","timestamp":1132748982000},"page":"258-265","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["The complexity of shortest path and dilation bounded interval routing"],"prefix":"10.1007","author":[{"given":"R.","family":"Kr\u00e1\u013eovi\u010d","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Ru\u017ei\u010dka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.","family":"\u0160tefankovi\u010d","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,9,26]]},"reference":[{"key":"30_CR1","doi-asserted-by":"crossref","unstructured":"T. Eilam, S. Moran, S. Zaks: A Lower Bound for Linear Interval Routing. International Workshop on Distributed Algorithms (WDAG), Lecture Notes in Computer Science, Springer Verlag, pp. 191\u2013205, 1996.","DOI":"10.1007\/3-540-61769-8_13"},{"key":"30_CR2","doi-asserted-by":"crossref","unstructured":"M. Flammini, J. van Leeuwen, A. Marchetti-Spaccamela: The complexity of interval routing on random graphs. In MFCS, Lecture Notes in Computer Science 969, Springer-Verlag, pp. 37\u201349, 1995.","DOI":"10.1007\/3-540-60246-1_111"},{"key":"30_CR3","doi-asserted-by":"crossref","unstructured":"M. Flammini, E. Nardelli: On the Path Length in Interval Routing Schemes. Manuscript. Submitted for publication, 1997.","DOI":"10.1142\/S0129626497000061"},{"key":"30_CR4","doi-asserted-by":"crossref","unstructured":"P. Fraigniaud, C. Gavoille: Optimal interval routing. In CONPAR, Lecture Notes in Computer Science 854, Springer-Verlag, pp. 785\u2013796, 1994.","DOI":"10.1007\/3-540-58430-7_68"},{"key":"30_CR5","doi-asserted-by":"crossref","unstructured":"P. Fraigniaud, C. Gavoille:, Local Memory Requirement of Universal Routing Schemes. In 8th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), ACM Press, June 1996.","DOI":"10.1145\/237502.237541"},{"key":"30_CR6","volume-title":"Lower Bounds for Shortest Path Interval Routing","author":"C. Gavoille","year":"1996","unstructured":"C. Gavoille, S. P\u00e9rennes: Lower Bounds for Shortest Path Interval Routing. In SIROCCO, Siena, June 6\u20138, 1996."},{"key":"30_CR7","doi-asserted-by":"crossref","unstructured":"C. Gavoille: On the Dilation of Interval Routing. Manuscript. Accepted to MFCS'97, August 1997.","DOI":"10.1007\/BFb0029969"},{"key":"30_CR8","volume-title":"The Complexity of Shortest Path and Dilation Bounded Interval Routing","author":"R. Kr\u00e1\u013aovi\u010d","year":"1996","unstructured":"R. Kr\u00e1\u013aovi\u010d, P. Ru\u017ei\u010dka, D. Stefankovi\u010d: The Complexity of Shortest Path and Dilation Bounded Interval Routing. Technical Report, Department of Computer Science, Comenius University, Bratislava, August 1996 (submitted for publication)."},{"key":"30_CR9","doi-asserted-by":"crossref","unstructured":"E. Kranakis, D. Krizanc: Lower Bounds for Compact Routing. In 13th Annual Symposium on Theoretical Aspects of Computer Science (STACS), February 1996.","DOI":"10.1007\/3-540-60922-9_43"},{"key":"30_CR10","unstructured":"F. Meyer auf der Heide, C. Scheideler: Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols. Proc. of the 37th Symposium on Foundations of Computer Science (FOGS), November 1996."},{"key":"30_CR11","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1145\/65950.65953","volume":"36","author":"D. Peleg","year":"1989","unstructured":"D. Peleg, E. Upfal: A Tradeoff between Space and Efficiency for Routing Tables. Journal of the ACM, 36, pp. 510\u2013530, 1989.","journal-title":"Journal of the ACM"},{"key":"30_CR12","doi-asserted-by":"crossref","unstructured":"P. Ru\u017ei\u010dka: On the efficiency of interval routing algorithms. In MFCS'88, Lecture Notes in Computer Science 324, Springer-Verlag, pp. 492\u2013500, 1988.","DOI":"10.1007\/BFb0017172"},{"key":"30_CR13","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1093\/comjnl\/28.1.5","volume":"28","author":"M. Santoro","year":"1985","unstructured":"M. Santoro, R. Khatib: Labelling and implicit routing in networks. The Computer Journal, 28, pp. 5\u20138, 1985.","journal-title":"The Computer Journal"},{"key":"30_CR14","series-title":"Technical Report 94-04","first-page":"10","volume-title":"A lower bound for interval routing in general networks","author":"S.S.H. Tse","year":"1994","unstructured":"S.S.H. Tse, F.C.M. Lau: A lower bound for interval routing in general networks. Technical Report 94-04, Dept. of Computer Science, The University of Hong Kong, Hong Kong, p. 10, July 1994 (to appear in Networks)."},{"key":"30_CR15","unstructured":"S.S.H. Tse, F.C.M. Lau: Lower bounds for multi-label interval routing. Proceedings of SIROCCO'95, pp. 123\u2013134, 1995."},{"key":"30_CR16","unstructured":"S.S.H. Tse, F.C.M. Lau: Two lower bounds for multi-label interval routing. Proceeding of Computing: The Australasian Theory Symposium (CATS'97), Sydney, Australia, February 1997."},{"key":"30_CR17","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1093\/comjnl\/30.4.298","volume":"30","author":"J. Leeuwen van","year":"1987","unstructured":"J. van Leeuwen, R. B. Tan: Interval routing. The Computer Journal, 30, pp. 298\u2013307, 1987. *** DIRECT SUPPORT *** A0008C42 00009","journal-title":"The Computer Journal"}],"container-title":["Lecture Notes in Computer Science","Euro-Par'97 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0002742","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,20]],"date-time":"2020-04-20T00:49:36Z","timestamp":1587343776000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0002742"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540634409","9783540695493"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/bfb0002742","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]},"assertion":[{"value":"26 September 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}