{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:58:23Z","timestamp":1725566303994},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540230250"},{"type":"electronic","value":"9783540301400"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30140-0_14","type":"book-chapter","created":{"date-parts":[[2010,9,19]],"date-time":"2010-09-19T01:31:13Z","timestamp":1284859873000},"page":"134-145","source":"Crossref","is-referenced-by-count":3,"title":["Direct Routing: Algorithms and Complexity"],"prefix":"10.1007","author":[{"given":"Costas","family":"Busch","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Malik","family":"Magdon-Ismail","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marios","family":"Mavronicolas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul","family":"Spirakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0020-0190(95)00208-1","volume":"57","author":"A. Symvonis","year":"1996","unstructured":"Symvonis, A.: Routing on trees. Information Processing Letters\u00a057, 215\u2013223 (1996)","journal-title":"Information Processing Letters"},{"key":"14_CR2","unstructured":"Alstrup, S., Holm, J., de Lichtenberg, K., Thorup, M.: Direct routing on trees. In: Proc. 9th Symposium on Discrete Algorithms (SODA 1998), pp. 342\u2013349 (1998)"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Cypher, R., auf der Heide, F.M., Scheideler, C., V\u00f6cking, B.: Universal algorithms for store-and-forward and wormhole routing, pp. 356\u2013365 (1996)","DOI":"10.1145\/237814.237982"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"Adler, M., Khanna, S., Rajaraman, R., Rosen, A.: Time-constrained scheduling of weighted packets on trees and meshes. In: Proc. 11th Symposium on Parallel Algorithms and Architectures, SPAA (1999)","DOI":"10.1145\/305619.305620"},{"key":"14_CR5","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1137\/S0895480192236628","volume":"7","author":"N. Alon","year":"1994","unstructured":"Alon, N., Chung, F., Graham, R.L.: Routing permutations on graphs via matching. SIAM Journal on Discrete Mathematics\u00a07, 513\u2013530 (1994)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"14_CR6","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/PL00009219","volume":"21","author":"I. Ben-Aroya","year":"1998","unstructured":"Ben-Aroya, I., Chinn, D.D., Schuster, A.: A lower bound for nearly minimal adaptive and hot potato algorithms. Algorithmica\u00a021, 347\u2013376 (1998)","journal-title":"Algorithmica"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Busch, C., Herlihy, M., Wattenhofer, R.: Hard-potato routing. In: Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, pp. 278\u2013285 (2000)","DOI":"10.1145\/335305.338762"},{"key":"14_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/3-540-60313-1_154","volume-title":"Algorithms - ESA \u201995","author":"F. Meyer auf der Heide","year":"1995","unstructured":"Meyer auf der Heide, F., Scheideler, C.: Routing with bounded buffers and hotpotato routing in vertex-symmetric networks. In: Spirakis, P.G. (ed.) ESA 1995. LNCS, vol.\u00a0979, pp. 341\u2013354. Springer, Heidelberg (1995)"},{"key":"14_CR9","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/s004930050061","volume":"19","author":"T. Leighton","year":"1999","unstructured":"Leighton, T., Maggs, B., Richa, A.W.: Fast algorithms for finding O(congestion + dilation) packet routing schedules. Combinatorica\u00a019, 375\u2013401 (1999)","journal-title":"Combinatorica"},{"key":"14_CR10","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1006\/jagm.1998.0980","volume":"31","author":"F. Meyer auf der Heide","year":"1999","unstructured":"Meyer auf der Heide, F., V\u00f6cking, B.: Shortest-path routing in arbitrary networks. Journal of Algorithms\u00a031, 105\u2013131 (1999)","journal-title":"Journal of Algorithms"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Ostrovsky, R., Rabani, Y.: Universal O(congestion+dilation+log1+\u03b5 N) local control packet switching algorithms. In: Proceedings of the 29th Annual ACM Symposium on the Theory of Computing, New York, pp. 644\u2013653 (1997)","DOI":"10.1145\/258533.258659"},{"key":"14_CR12","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814068","volume-title":"Random Graphs","author":"B. Bollob\u00e1s","year":"2001","unstructured":"Bollob\u00e1s, B.: Random Graphs, 2nd edn. Cambridge University Press, Cambridge (2001)","edition":"2"},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"Maggs, B.M., auf der Heide, F.M., Vocking, B., Westermann, M.: Exploiting locality for data management in systems of limited bandwidth. In: IEEE Symposium on Foundations of Computer Science, pp. 284\u2013293 (1997)","DOI":"10.1109\/SFCS.1997.646117"},{"key":"14_CR14","volume-title":"Introduction to Parallel Algorithms and Architectures: Arrays - Trees - Hypercubes","author":"F.T. Leighton","year":"1992","unstructured":"Leighton, F.T.: Introduction to Parallel Algorithms and Architectures: Arrays - Trees - Hypercubes. Morgan Kaufmann, San Mateo (1992)"},{"key":"14_CR15","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1137\/0211027","volume":"11","author":"L.G. Valiant","year":"1982","unstructured":"Valiant, L.G.: A scheme for fast parallel communication. SIAM Journal on Computing\u00a011, 350\u2013361 (1982)","journal-title":"SIAM Journal on Computing"},{"key":"14_CR16","doi-asserted-by":"crossref","unstructured":"Valiant, L.G., Brebner, G.J.: Universal schemes for parallel communication. In: Proc. 13th Annual ACM Symposium on Theory of Computing, pp. 263\u2013277 (1981)","DOI":"10.1145\/800076.802479"},{"key":"14_CR17","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, Ney York (1979)"},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"Feige, U., Kilian, J.: Zero knowledge and the chromatic number. In: IEEE Conference on Computational Complexity, pp. 278\u2013287 (1996)","DOI":"10.1109\/CCC.1996.507690"},{"key":"14_CR19","volume-title":"Approximation Algorithms for NP-Hard Problems","author":"D.S. Hochbaum","year":"1997","unstructured":"Hochbaum, D.S.: Approximation Algorithms for NP-Hard Problems. PWS Publishing Company, New York (1997)"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30140-0_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:44:28Z","timestamp":1605761068000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30140-0_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540230250","9783540301400"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30140-0_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}