{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T04:19:34Z","timestamp":1743135574837,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":15,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387307701"},{"type":"electronic","value":"9780387301624"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-0-387-30162-4_351","type":"book-chapter","created":{"date-parts":[[2008,6,26]],"date-time":"2008-06-26T18:29:45Z","timestamp":1214504985000},"page":"791-793","source":"Crossref","is-referenced-by-count":0,"title":["Routing"],"prefix":"10.1007","author":[{"given":"J\u00f3zsef","family":"B\u00e9k\u00e9si","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G\u00e1bor","family":"Galambos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"6","key":"351_CR1_351","doi-asserted-by":"publisher","first-page":"1193","DOI":"10.1109\/TNET.2006.886296","volume":"14","author":"D. Applegate","year":"2006","unstructured":"Applegate, D., Cohen, E.: Making routing robust to changing traffic demands: algorithms and evaluation. IEEE\/ACM Trans Netw 14(6), 1193\u20131206 (2006). doi:10.1109\/TNET.2006.886296","journal-title":"IEEE\/ACM Trans Netw"},{"issue":"3","key":"351_CR2_351","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1145\/258128.258201","volume":"44","author":"J. Aspnes","year":"1997","unstructured":"Aspnes, J., Azar, Y., Fiat, A., Plotkin, S., Waarts, O.: On-line routing of virtual circuits with applications to load balancing and machine scheduling. J.\u00a0ACM 44(3), 486\u2013504 (1997)","journal-title":"J. ACM"},{"key":"351_CR3_351","doi-asserted-by":"crossref","unstructured":"Azar, Y., Chaiutin, Y.: Optimal node routing. In: Proceedings of the 23rd International Symposium on Theoretical Aspects of Computer Science, 2006, pp.\u00a0596\u2013607","DOI":"10.1007\/11672142_49"},{"key":"351_CR4_351","doi-asserted-by":"crossref","unstructured":"Azar, Y., Cohen, E., Fiat, A., Kaplan, H. R\u00e4cke, H.: Optimal oblivious routing in polynomial time. In: Proceedings of the Thirty-Fifth Annual ACM Symposium on Theory of Computing, 2003, pp.\u00a0383\u2013388","DOI":"10.1145\/780542.780599"},{"key":"351_CR5_351","doi-asserted-by":"crossref","unstructured":"Bansal, N., Blum, A., Chawla, S.: Meyerson, A.: Online oblivious routing. In: Proceedings of the 15th Annual ACM Symposium on Parallel Algorithms, 2003, pp.\u00a044\u201349","DOI":"10.1145\/777412.777420"},{"issue":"1","key":"351_CR6_351","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1016\/0022-0000(85)90008-X","volume":"30","author":"A. Borodin","year":"1985","unstructured":"Borodin, A., Hopcroft, J.E.: Routing, merging and sorting on parallel models of computation. J.\u00a0Comput. Syst. Sci. 30(1), 130\u2013145 (1985)","journal-title":"J. Comput. Syst. Sci."},{"key":"351_CR7_351","unstructured":"Hajiaghayi, M.T., Kleinberg, R.D., Leighton, T., R\u00e4cke, H.: Oblivious routing on node\u2010capacitated and directed graphs. In: Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms, 2005, pp.\u00a0782\u2013790"},{"key":"351_CR8_351","doi-asserted-by":"crossref","unstructured":"Hajiaghayi, M.T., Kim, J.H., Leighton, T., R\u00e4cke, H.: Oblivious routing in directed graphs with random demands. In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005, pp.\u00a0193\u2013201","DOI":"10.1145\/1060590.1060619"},{"key":"351_CR9_351","doi-asserted-by":"crossref","unstructured":"Kaklamanis, C., Krizanc, D., Tsantilas, A.: Tight bounds for oblivious routing in the hypercube. In: Proc. 2nd Annual ACM Symposium on Parallel Algorithms and Architectures, 1990, pp.\u00a031\u201336","DOI":"10.1145\/97444.97453"},{"key":"351_CR10_351","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 Publishers, San Fransisco (1992)"},{"key":"351_CR11_351","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/BFb0029572","volume-title":"Online Algorithms \u2013 The State of the Art. Chap. 11","author":"S. Leonardi","year":"1998","unstructured":"Leonardi, S.: On-line network routing. In: Fiat, A., Woeginger, G. (eds.) Online Algorithms\u00a0\u2013 The State of the Art. Chap.\u00a011, pp.\u00a0242\u2013267. Springer, Heidelberg (1998)"},{"key":"351_CR12_351","unstructured":"R\u00e4cke, H.: Minimizing Congestions in General Networks. In: Proceedings of the 43rd Symposium on Foundations of Computer Science, 2002, pp.\u00a043\u201352"},{"key":"351_CR13_351","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF02579324","volume":"7","author":"P. Raghavan","year":"1987","unstructured":"Raghavan, P., Thompson, C.D.: Randomized rounding: a\u00a0technique for provably good algorithms and algorithmic proofs. Combinatorica 7, 365\u2013374 (1987)","journal-title":"Combinatorica"},{"key":"351_CR14_351","volume-title":"Proceedings of the ACM SIGCOMM'02 Conference","author":"N. Spring","year":"2002","unstructured":"Spring, N., Mahajan, R., Wetherall, D.: Measuring ISP topologies with Rocketfuel. In: Proceedings of the ACM SIGCOMM'02 Conference. ACM, New York (2002)"},{"key":"351_CR15_351","doi-asserted-by":"crossref","unstructured":"Valiant, L.G., Brebner, G.: Universal schemes for parallel communication. In: Proceedings of the 13th ACM Symposium on Theory of Computing, 1981, pp.\u00a0263\u2013277","DOI":"10.1145\/800076.802479"}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-30162-4_351","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,3]],"date-time":"2022-09-03T03:27:25Z","timestamp":1662175645000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-30162-4_351"}},"subtitle":["2003; Azar, Cohen, Fiat, Kaplan, R\u00e4cke"],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387307701","9780387301624"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-30162-4_351","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}