{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:30:49Z","timestamp":1725474649986},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540488224"},{"type":"electronic","value":"9783540488248"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11922377_5","type":"book-chapter","created":{"date-parts":[[2006,12,5]],"date-time":"2006-12-05T06:21:13Z","timestamp":1165299673000},"page":"45-57","source":"Crossref","is-referenced-by-count":0,"title":["Distributed Routing in Tree Networks with Few Landmarks"],"prefix":"10.1007","author":[{"given":"Ioannis Z.","family":"Emiris","sequence":"first","affiliation":[]},{"given":"Euripides","family":"Markou","sequence":"additional","affiliation":[]},{"given":"Aris","family":"Pagourtzis","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Abraham, I., Gavoille, C., Malkhi, D.: On space-stretch trade-offs for compact routing schemes. Research Report RR-1374-05, LaBRI, France (November 2005)","DOI":"10.1145\/1148109.1148143"},{"key":"5_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1007\/11561927_32","volume-title":"Distributed Computing","author":"I. Abraham","year":"2005","unstructured":"Abraham, I., Gavoille, C., Malkhi, D.: Compact routing for graphs excluding a fixed minor. In: Fraigniaud, P. (ed.) DISC 2005. LNCS, vol.\u00a03724, pp. 442\u2013456. Springer, Heidelberg (2005)"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Abraham, I., Malkhi, D.: Name Independent Routing for Growth Bounded Networks. In: Proc.17th ACM Symp. Parall. Algorithms and Architectures (SPAA 2005), pp. 49\u201355 (2005)","DOI":"10.1145\/1073970.1073978"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Bar-Noy, A., Linial, N., Peleg, D.: Compact distributed data structures for adaptive network routing. In: Proc. of 21st ACM Symp. on Theory of Computing, pp. 230\u2013240 (May 1989)","DOI":"10.1145\/73007.73053"},{"key":"5_CR5","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1006\/jagm.1993.1047","volume":"15","author":"J. Bar-Ilan","year":"1993","unstructured":"Bar-Ilan, J., Kortsarz, G., Peleg, D.: How to allocate network centers. J. Algorithms\u00a015, 385\u2013415 (1993)","journal-title":"J.Algorithms"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Buhrman, H., Hoepman, J.-H., Vitanyi, P.: Optimal routing tables. In: Proc. 15th ACM Symp. on Principles of Distributed Computing, pp. 134\u2013142 (May 1996)","DOI":"10.1145\/248052.248076"},{"key":"5_CR7","unstructured":"Fang, Q., Gao, J., Guibas, L., de Silva, V., Zhang, L.: GLIDER: Gradient Landmark- Based Distributed Routing for Sensor Networks. In: Proc. 24th Conf. of IEEE Com. Soc. (INFOCOM 2005) (2005)"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Fraigniaud, P., Gavoille, C.: Memory requirement for universal routing schemes. In: Proc. 14th ACM Symp. on Principles of Distributed Computing, pp. 223\u2013230 (August 1995)","DOI":"10.1145\/224964.224989"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Fraigniaud, P., Gavoille, C.: Local memory requirement of universal routing schemes. In: Proc. 8th ACM Symp. on Parallel Algorithms and Architectures, pp. 183\u2013188 (June 1996)","DOI":"10.1145\/237502.237541"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Frederickson, G.N., Janardan, R.: Separator-Based Strategies for Efficient Message Routing. In: Proc. 27th IEEE Symp. on Foundations of Computer Science, pp. 428\u2013437 (1986)","DOI":"10.1109\/SFCS.1986.49"},{"key":"5_CR11","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/BF01762113","volume":"3","author":"G.N. Frederickson","year":"1988","unstructured":"Frederickson, G.N., Janardan, R.: Designing networks with compact routing tables. Algorithmica\u00a03, 171\u2013190 (1988)","journal-title":"Algorithmica"},{"key":"5_CR12","doi-asserted-by":"publisher","first-page":"843","DOI":"10.1137\/0218058","volume":"18","author":"G.N. Frederickson","year":"1989","unstructured":"Frederickson, G.N., Janardan, R.: Efficient message routing in planar networks. SIAM Journal on Computing\u00a018, 843\u2013857 (1989)","journal-title":"SIAM Journal on Computing"},{"key":"5_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1007\/3-540-48224-5_62","volume-title":"Automata, Languages and Programming","author":"P. Fraigniaud","year":"2001","unstructured":"Fraigniaud, P., Gavoille, C.: Routing in Trees. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol.\u00a02076, pp. 757\u2013772. Springer, Heidelberg (2001)"},{"key":"5_CR14","unstructured":"Gavoille, C., Gengler, M.: Space-efficiency of routing schemes of stretch factor three. In: Proc. 4th Int. Colloq. on Structural Information & Communication Complexity, pp. 162\u2013175. Carleton Scientific (1997)"},{"issue":"2-3","key":"5_CR15","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/s00446-002-0073-5","volume":"16","author":"C. Gavoille","year":"2003","unstructured":"Gavoille, C., Peleg, D.: Compact and localized distributed data structures. Distributed Computing\u00a016(2-3), 111\u2013120 (2003)","journal-title":"Distributed Computing"},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Gavoille, C., Perennes, S.: Memory requirement for routing in distributed networks. In: Proc. 15th ACM Symp. on Principles of Distributed Computing, pp. 125\u2013133 (May 1996)","DOI":"10.1145\/248052.248075"},{"key":"5_CR17","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1287\/moor.10.2.180","volume":"10","author":"D. Hochbaum","year":"1985","unstructured":"Hochbaum, D., Shmoys, D.B.: A best possible heuristic for the k\u2009\u2212center problem. Mathematics of Operations Research\u00a010, 180\u2013184 (1985)","journal-title":"Mathematics of Operations Research"},{"issue":"3","key":"5_CR18","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0166-218X(95)00106-2","volume":"70","author":"S. Khuller","year":"1996","unstructured":"Khuller, S., Raghavachari, B., Rosenfeld, A.: Landmarks in Graphs. Discrete Applied Mathematics\u00a070(3), 217\u2013229 (1996)","journal-title":"Discrete Applied Mathematics"},{"key":"5_CR19","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1137\/S0895480197329776","volume":"13","author":"S. Khuller","year":"2000","unstructured":"Khuller, S., Sussmann, Y.J.: The capacitated k-center problem. SIAM J. Discrete Math.\u00a013, 403\u2013418 (2000)","journal-title":"SIAM J. Discrete Math."},{"key":"5_CR20","first-page":"155","volume":"1","author":"L. Kleinrock","year":"1977","unstructured":"Kleinrock, L., Kamoun, F.: Hierarchical routing for large networks: performance evaluation and optimization. Computer Networks\u00a01, 155\u2013174 (1977)","journal-title":"Computer Networks"},{"key":"5_CR21","first-page":"221","volume":"10","author":"L. Kleinrock","year":"1980","unstructured":"Kleinrock, L., Kamoun, F.: Optimal clustering structures for hierarchical topological design of large computer networks. Computer Networks\u00a010, 221\u2013248 (1980)","journal-title":"Computer Networks"},{"key":"5_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1007\/3-540-60922-9_43","volume-title":"STACS 96","author":"E. Kranakis","year":"1996","unstructured":"Kranakis, E., Krizanc, D.: Lower bounds for compact routing. In: Puech, C., Reischuk, R. (eds.) STACS 1996. LNCS, vol.\u00a01046, pp. 529\u2013540. Springer, Heidelberg (1996)"},{"key":"5_CR23","doi-asserted-by":"crossref","unstructured":"Peleg, D.: Distance-dependent distributed directories. Information and Computation, pp. 270\u2013298 (1993)","DOI":"10.1006\/inco.1993.1020"},{"key":"5_CR24","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1145\/65950.65953","volume":"36","author":"D. Peleg","year":"1989","unstructured":"Peleg, D., Upfal, E.: A tradeoff between size and efficiency for routing tables. J. ACM\u00a036, 510\u2013530 (1989)","journal-title":"J. ACM"},{"key":"5_CR25","unstructured":"Perlman, R.: Hierarchical networks and the subnetwork partition problem. In: Proc. 5th Conf. on System Sciences (1982)"},{"key":"5_CR26","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1093\/comjnl\/28.1.5","volume":"28","author":"N. Santoro","year":"1985","unstructured":"Santoro, N., Khatib, R.: Labelling and implicit routing in networks. The Computer Journal\u00a028, 5\u20138 (1985)","journal-title":"The Computer Journal"},{"key":"5_CR27","doi-asserted-by":"crossref","unstructured":"Thorup, M., Zwick, U.: Compact routing schemes. In: Proc. 13th annual ACM symposium on Parallel algorithms and architectures, pp. 1\u201310, Crete Island, Greece (2001)","DOI":"10.1145\/378580.378581"},{"issue":"4","key":"5_CR28","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1145\/52325.52329","volume":"18","author":"P.F. Tsuchiya","year":"1988","unstructured":"Tsuchiya, P.F.: The landmark hierarchy: A new hierarchy for routing in very large networks. Computer Communication Review\u00a018(4), 35\u201342 (1988)","journal-title":"Computer Communication Review"}],"container-title":["Lecture Notes in Computer Science","Combinatorial and Algorithmic Aspects of Networking"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11922377_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:44:56Z","timestamp":1619495096000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11922377_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540488224","9783540488248"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/11922377_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}