{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T17:21:20Z","timestamp":1649092880958},"reference-count":30,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2003,4,1]],"date-time":"2003-04-01T00:00:00Z","timestamp":1049155200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3796,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Discrete Algorithms"],"published-print":{"date-parts":[[2003,4]]},"DOI":"10.1016\/s1570-8667(03)00027-3","type":"journal-article","created":{"date-parts":[[2003,11,27]],"date-time":"2003-11-27T07:12:55Z","timestamp":1069917175000},"page":"237-254","source":"Crossref","is-referenced-by-count":2,"title":["The compactness of adaptive routing tables"],"prefix":"10.1016","volume":"1","author":[{"given":"Cyril","family":"Gavoille","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Akka","family":"Zemmari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1570-8667(03)00027-3_BIB001","series-title":"30th Annual IEEE Symposium on Foundations of Computer Science (FOCS)","first-page":"370","article-title":"Upper and lower bounds for routing schemes in dynamic networks","author":"Afek","year":"1989"},{"key":"10.1016\/S1570-8667(03)00027-3_BIB002","series-title":"21st Annual ACM Symposium on Theory of Computing (STOC)","first-page":"479","article-title":"Compact distributed data structures for adaptive routing","author":"Awerbuch","year":"1989"},{"key":"10.1016\/S1570-8667(03)00027-3_BIB003","unstructured":"E.M. Baker, R.B. Tan, J. van Leeuwen, Prefix routing schemes in dynamic networks, Technical Report RUU-CS-90-10, Dept. of Computer Science, Utrecht University, 1990"},{"key":"10.1016\/S1570-8667(03)00027-3_BIB004","series-title":"17th Annual ACM Symposium on Principles of Distributed Computing (PODC)","first-page":"11","article-title":"Compact routing schemes with low stretch factor","author":"Eilam","year":"1998"},{"key":"10.1016\/S1570-8667(03)00027-3_BIB005","series-title":"4th International Colloquium on Structural Information & Communication Complexity (SIROCCO)","first-page":"99","article-title":"The complexity of the characterization of networks supporting shortest-path interval routing","author":"Eilam","year":"1997"},{"key":"10.1016\/S1570-8667(03)00027-3_BIB006","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1002\/(SICI)1097-0037(199908)34:1<37::AID-NET4>3.0.CO;2-7","article-title":"Lower bounds for linear interval routing","volume":"34","author":"Eilam","year":"1999","journal-title":"Networks"},{"key":"10.1016\/S1570-8667(03)00027-3_BIB007","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1142\/S0129626497000061","article-title":"On the hardness of devising interval routing schemes","volume":"7","author":"Flammini","year":"1997","journal-title":"Parallel Processing Lett."},{"key":"10.1016\/S1570-8667(03)00027-3_BIB008","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/PL00009211","article-title":"Interval routing schemes","volume":"21","author":"Fraigniaud","year":"1998","journal-title":"Algorithmica"},{"key":"10.1016\/S1570-8667(03)00027-3_BIB009","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/S0304-3975(97)86543-7","article-title":"On devising Boolean routing schemes","volume":"186","author":"Flammini","year":"1997","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S1570-8667(03)00027-3_BIB010","series-title":"5th International Colloquium on Structural Information & Communication Complexity (SIROCCO)","first-page":"201","article-title":"Characterization results of all shortest paths interval routing schemes","author":"Flammini","year":"1998"},{"key":"10.1016\/S1570-8667(03)00027-3_BIB011","series-title":"1st International Colloquium on Structural Information & Communication Complexity (SIROCCO)","first-page":"111","article-title":"Interval labeling schemes for chordal rings","author":"Flammini","year":"1994"},{"key":"10.1016\/S1570-8667(03)00027-3_BIB012","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\/S1570-8667(03)00027-3_BIB013","series-title":"27th Symposium on Foundations of Computer Science (FOCS)","first-page":"428","article-title":"Separator-based strategies for efficient message routing","author":"Frederickson","year":"1986"},{"key":"10.1016\/S1570-8667(03)00027-3_BIB014","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1137\/0219011","article-title":"Space-efficient message routing in c-decomposable networks","volume":"19","author":"Frederickson","year":"1990","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S1570-8667(03)00027-3_BIB015","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1093\/comjnl\/43.3.243","article-title":"On the dilation of interval routing","volume":"43","author":"Gavoille","year":"2000","journal-title":"Comput. J."},{"key":"10.1016\/S1570-8667(03)00027-3_BIB016","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/S0304-3975(99)00283-2","article-title":"A survey on interval routing","volume":"245","author":"Gavoille","year":"2000","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S1570-8667(03)00027-3_BIB017","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/jagm.1997.0915","article-title":"Worst case bounds for shortest path interval routing","volume":"27","author":"Gavoille","year":"1998","journal-title":"J. Algorithms"},{"key":"10.1016\/S1570-8667(03)00027-3_BIB018","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1137\/S0895480197328631","article-title":"The compactness of interval routing","volume":"12","author":"Gavoille","year":"1999","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S1570-8667(03)00027-3_BIB019","series-title":"15th Annual ACM Symposium on Principles of Distributed Computing (PODC)","first-page":"125","article-title":"Memory requirement for routing in distributed networks","author":"Gavoille","year":"1996"},{"key":"10.1016\/S1570-8667(03)00027-3_BIB020","series-title":"13th Annual Symposium on Theoretical Aspects of Computer Science (STACS)","first-page":"529","article-title":"Lower bounds for compact routing","volume":"1046","author":"Kranakis","year":"1996"},{"key":"10.1016\/S1570-8667(03)00027-3_BIB021","series-title":"2nd International Colloquium on Structural Information & Communication Complexity (SIROCCO)","first-page":"101","article-title":"Compact routing and shortest path information","author":"Kranakis","year":"1995"},{"key":"10.1016\/S1570-8667(03)00027-3_BIB022","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/S0304-3975(98)00042-5","article-title":"The complexity of shortest path and dilation bounded interval routing","volume":"234","author":"Kr\u00e1\u013eovi\u010d","year":"2000","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S1570-8667(03)00027-3_BIB023","series-title":"2nd IEEE International Conference on Algorithms & Architectures for Parallel Processing (ICAPP)","first-page":"348","article-title":"Adaptive, fault-tolerant, deadlock-free and livelock-free interval routing in mesh networks","author":"Loh","year":"1996"},{"key":"10.1016\/S1570-8667(03)00027-3_BIB024","series-title":"4th International Colloquium on Structural Information & Communication Complexity (SIROCCO)","first-page":"125","article-title":"Compact routing on chordal rings of degree four","author":"Narayanan","year":"1997"},{"key":"10.1016\/S1570-8667(03)00027-3_BIB025","doi-asserted-by":"crossref","first-page":"510","DOI":"10.1145\/65950.65953","article-title":"A trade-off between space and efficiency for routing tables","volume":"36","author":"Peleg","year":"1989","journal-title":"J. ACM"},{"key":"10.1016\/S1570-8667(03)00027-3_BIB026","article-title":"On the complexity of multi-dimensional interval routing schemes","volume":"245","author":"Ru\u017ei\u010dka","year":"1999","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S1570-8667(03)00027-3_BIB027","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."},{"key":"10.1016\/S1570-8667(03)00027-3_BIB028","series-title":"4th International Colloquium on Structural Information & Communication Complexity (SIROCCO)","first-page":"112","article-title":"An optimal lower bound for interval routing in general networks","author":"Tse","year":"1997"},{"key":"10.1016\/S1570-8667(03)00027-3_BIB029","series-title":"The Book of L","first-page":"259","article-title":"Computer networks with compact routing tables","author":"van Leeuwen","year":"1986"},{"key":"10.1016\/S1570-8667(03)00027-3_BIB030","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."}],"container-title":["Journal of Discrete Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1570866703000273?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1570866703000273?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T12:57:51Z","timestamp":1550321871000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1570866703000273"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,4]]},"references-count":30,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,4]]}},"alternative-id":["S1570866703000273"],"URL":"https:\/\/doi.org\/10.1016\/s1570-8667(03)00027-3","relation":{},"ISSN":["1570-8667"],"issn-type":[{"value":"1570-8667","type":"print"}],"subject":[],"published":{"date-parts":[[2003,4]]}}}