{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T05:55:06Z","timestamp":1769925306742,"version":"3.49.0"},"reference-count":24,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2003,2,1]],"date-time":"2003-02-01T00:00:00Z","timestamp":1044057600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Algorithms"],"published-print":{"date-parts":[[2003,2]]},"DOI":"10.1016\/s0196-6774(03)00002-6","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T13:37:48Z","timestamp":1049722668000},"page":"97-114","source":"Crossref","is-referenced-by-count":44,"title":["Compact routing schemes with low stretch factor"],"prefix":"10.1016","volume":"46","author":[{"given":"Tamar","family":"Eilam","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cyril","family":"Gavoille","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Peleg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0196-6774(03)00002-6_BIB001","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/0196-6774(90)90017-9","article-title":"Improved routing strategies with succinct tables","volume":"11","author":"Awerbuch","year":"1990","journal-title":"J. Algorithms"},{"key":"10.1016\/S0196-6774(03)00002-6_BIB002","series-title":"31st Symp. on Foundations of Computer Science (FOCS)","first-page":"503","article-title":"Sparse partitions","author":"Awerbuch","year":"1990"},{"key":"10.1016\/S0196-6774(03)00002-6_BIB003","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1137\/0405013","article-title":"Routing with polynomial communication-space trade-off","volume":"5","author":"Awerbuch","year":"1992","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0196-6774(03)00002-6_BIB004","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1006\/jagm.2000.1134","article-title":"Compact routing with minimum stretch","volume":"38","author":"Cowen","year":"2001","journal-title":"J. Algorithms"},{"key":"10.1016\/S0196-6774(03)00002-6_BIB005","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\/S0196-6774(03)00002-6_BIB006","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/S0304-3975(97)00070-4","article-title":"Multidimensional interval routing schemes","volume":"205","author":"Flammini","year":"1998","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0196-6774(03)00002-6_BIB007","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/s004460050025","article-title":"Universal routing schemes","volume":"10","author":"Fraigniaud","year":"1997","journal-title":"J. Distrib. Comput."},{"key":"10.1016\/S0196-6774(03)00002-6_BIB008","series-title":"28th Int. Colloquium on Automata, Languages and Programming (ICALP)","first-page":"757","article-title":"Routing in trees","volume":"2076","author":"Fraigniaud","year":"2001"},{"key":"10.1016\/S0196-6774(03)00002-6_BIB009","series-title":"27th Symp. 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\/S0196-6774(03)00002-6_BIB010","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/BF01762113","article-title":"Designing networks with compact routing tables","volume":"3","author":"Frederickson","year":"1988","journal-title":"Algorithmica"},{"key":"10.1016\/S0196-6774(03)00002-6_BIB011","series-title":"10th Int. Workshop on Distributed Algorithms (WDAG)","first-page":"206","article-title":"Topological routing schemes","volume":"1151","author":"Gambosi","year":"1996"},{"key":"10.1016\/S0196-6774(03)00002-6_BIB012","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\/S0196-6774(03)00002-6_BIB013","doi-asserted-by":"crossref","first-page":"679","DOI":"10.1006\/jpdc.2000.1705","article-title":"Space-efficiency of routing schemes of stretch factor three","volume":"61","author":"Gavoille","year":"2001","journal-title":"J. Parallel Distrib. Comput."},{"key":"10.1016\/S0196-6774(03)00002-6_BIB014","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\/S0196-6774(03)00002-6_BIB015","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\/S0196-6774(03)00002-6_BIB016","series-title":"15th Annual ACM Symp. 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\/S0196-6774(03)00002-6_BIB017","series-title":"Combinatorial Theory","author":"Hall","year":"1986"},{"key":"10.1016\/S0196-6774(03)00002-6_BIB018","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\u00e1l\u0306ovi\u010d","year":"2000","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0196-6774(03)00002-6_BIB019","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1016\/0012-365X(75)90058-8","article-title":"On the ratio of optimal integral and fractional covers","volume":"13","author":"Lov\u00e1sz","year":"1975","journal-title":"Discrete Math."},{"key":"10.1016\/S0196-6774(03)00002-6_BIB020","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\/S0196-6774(03)00002-6_BIB021","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\/S0196-6774(03)00002-6_BIB022","series-title":"13th Annual ACM Symp. on Parallel Algorithms and Architectures (SPAA), Hersonissos, Crete, Greece","first-page":"1","article-title":"Compact routing schemes","author":"Thorup","year":"2001"},{"key":"10.1016\/S0196-6774(03)00002-6_BIB023","series-title":"4th Int. 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\/S0196-6774(03)00002-6_BIB024","series-title":"The Book of L","first-page":"259","article-title":"Computer networks with compact routing tables","author":"van Leeuwen","year":"1986"}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0196677403000026?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0196677403000026?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,24]],"date-time":"2019-03-24T00:57:33Z","timestamp":1553389053000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0196677403000026"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,2]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,2]]}},"alternative-id":["S0196677403000026"],"URL":"https:\/\/doi.org\/10.1016\/s0196-6774(03)00002-6","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[2003,2]]}}}