{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:09:52Z","timestamp":1725664192525},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540590422"},{"type":"electronic","value":"9783540491750"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-59042-0_80","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T16:58:45Z","timestamp":1330275525000},"page":"279-290","source":"Crossref","is-referenced-by-count":3,"title":["Interval routing schemes"],"prefix":"10.1007","author":[{"given":"Michele","family":"Flammini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giorgio","family":"Gambosi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sandro","family":"Salomone","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"B. Awerbuch, A. Bar-Noy, N. Linial, D. Peleg. Compact distributed data structures for adaptive routing. Proc. 21st ACM Symp. on Theory of Computing, pp. 479\u2013489, 1989.","key":"24_CR1","DOI":"10.1145\/73007.73053"},{"key":"24_CR2","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/0196-6774(90)90017-9","volume":"11","author":"B. Awerbuch","year":"1990","unstructured":"B. Awerbuch, A. Bar-Noy, N. Linial, D. Peleg. Improved routing strategies with succinct tables. Journal of Algorithms, 11, pp. 307\u2013341, 1990.","journal-title":"Journal of Algorithms"},{"key":"24_CR3","volume-title":"Worst case analysis of a new heuristic for the travelling salesman problem. Report No. 388","author":"N. Christofides","year":"1976","unstructured":"N. Christofides. Worst case analysis of a new heuristic for the travelling salesman problem. Report No. 388, GSIA, Carnegie-Mellon University, Pittsburgh, PA, 1976."},{"key":"24_CR4","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/BF01762113","volume":"3","author":"G.N. Frederickson","year":"1988","unstructured":"G.N. Frederickson, R. Janardan. Designing networks with compact routing tables. Algorithmica, 3, pp. 171\u2013190, 1988.","journal-title":"Algorithmica"},{"key":"24_CR5","doi-asserted-by":"crossref","first-page":"843","DOI":"10.1137\/0218058","volume":"18","author":"G.N. Frederickson","year":"1989","unstructured":"G.N. Frederickson, R. Janardan. Efficient message routing in planar networks. SIAM Journal on Computing, 18, pp. 843\u2013857, 1989.","journal-title":"SIAM Journal on Computing"},{"key":"24_CR6","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1137\/0219011","volume":"19","author":"G.N. Frederickson","year":"1990","unstructured":"G.N. Frederickson, R. Janardan. Space efficient message routing in c-decomposable networks. SIAM Journal on Computing, 19, pp. 164\u2013181, 1990.","journal-title":"SIAM Journal on Computing"},{"doi-asserted-by":"crossref","unstructured":"M. Flammini, G. Gambosi, S. Salomone. Boolean Routing. Proc. 7th Int. Workshop on Distributed Algorithms (WDAG), Lecture Notes in Computer Science n. 725, Springer Verlag, pp. 219\u2013233, 1993.","key":"24_CR7","DOI":"10.1007\/3-540-57271-6_38"},{"key":"24_CR8","volume-title":"Computers and Intractability. A guide to the theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"M.R. Garey, D.S. Johnson. Computers and Intractability. A guide to the theory of NP-completeness. W.H. Freeman, San Francisco, 1979."},{"issue":"3","key":"24_CR9","doi-asserted-by":"crossref","first-page":"510","DOI":"10.1145\/65950.65953","volume":"36","author":"D. Peleg","year":"1989","unstructured":"D. Peleg, E. Upfal. A trade-off between space and efficiency for routing tables. Journal of the ACM, 36, 3, pp. 510\u2013530, 1989.","journal-title":"Journal of the ACM"},{"key":"24_CR10","doi-asserted-by":"crossref","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"},{"doi-asserted-by":"crossref","unstructured":"J. van Leeuwen, R.B. Tan. Routing with compact routing tables. In \u201cThe book of L\u201d, G. Rozemberg and A. Salomaa eds., Springer Verlag, pp. 259\u2013273, 1986.","key":"24_CR11","DOI":"10.1007\/978-3-642-95486-3_22"},{"key":"24_CR12","doi-asserted-by":"crossref","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.","journal-title":"The Computer Journal"}],"container-title":["Lecture Notes in Computer Science","STACS 95"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-59042-0_80.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:22:13Z","timestamp":1619572933000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-59042-0_80"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540590422","9783540491750"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-59042-0_80","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}