{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T05:46:58Z","timestamp":1743140818037,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":17,"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_261","type":"book-chapter","created":{"date-parts":[[2008,6,26]],"date-time":"2008-06-26T18:34:52Z","timestamp":1214505292000},"page":"585-588","source":"Crossref","is-referenced-by-count":0,"title":["Oblivious Routing"],"prefix":"10.1007","author":[{"given":"Nikhil","family":"Bansal","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"261_CR1_261","unstructured":"Alon, N., Awerbuch, B., Azar, Y., Buchbinder, N., Naor, J.: A\u00a0general approach to online network optimization problems. In: Symposium on Discrete Algorithms, pp.\u00a0570\u2013579 (2004)"},{"key":"261_CR2_261","doi-asserted-by":"crossref","unstructured":"Applegate, D., Cohen, E.: Making intra-domain routing robust to changing and uncertain traffic demands: understanding fundamental tradeoffs. In: SIGCOMM, pp.\u00a0313\u2013324 (2003)","DOI":"10.1145\/863955.863991"},{"issue":"1","key":"261_CR3_261","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1137\/S0097539794285983","volume":"27","author":"Y. Aumann","year":"1998","unstructured":"Aumann, Y., Rabani, Y.: An O(log k) approximate min-cut max-flow theorem and approximation algorithm. SIAM J.\u00a0Comput. 27(1), 291\u2013301 (1998)","journal-title":"SIAM J. Comput."},{"key":"261_CR4_261","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 35th ACM Symposium on the Theory of Computing, pp.\u00a0383\u2013388 (2003)","DOI":"10.1145\/780542.780599"},{"key":"261_CR5_261","doi-asserted-by":"crossref","unstructured":"Bansal, N., Blum, A., Chawla, S., Meyerson, A.: Online oblivious routing. In Symposium on Parallelism in Algorithms and Architectures, pp.\u00a044\u201349 (2003)","DOI":"10.1145\/777412.777420"},{"issue":"1","key":"261_CR6_261","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1016\/0022-0000(85)90008-X","volume":"10","author":"A. Borodin","year":"1985","unstructured":"Borodin, A., Hopcroft, J.: Routing, merging and sorting on parallel models of computation. J.\u00a0Comput. Syst. Sci. 10(1), 130\u2013145 (1985)","journal-title":"J. Comput. Syst. Sci."},{"key":"261_CR7_261","doi-asserted-by":"crossref","unstructured":"Chekuri, C., Khanna, S., Shepherd, F.B.: The All-or-Nothing Multicommodity Flow Problem. In: Proceedings of 36th ACM Symposium on Theory of Computing, pp.\u00a0156\u2013165 (2004)","DOI":"10.1145\/1007352.1007383"},{"key":"261_CR8_261","doi-asserted-by":"crossref","unstructured":"Hajiaghayi, M., Kim, J.H., Leighton, T., R\u00e4cke, H.: Oblivious routing in directed graphs with random demands. In: Symposium on Theory of Computing, pp.\u00a0193\u2013201 (2005)","DOI":"10.1145\/1060590.1060619"},{"key":"261_CR9_261","doi-asserted-by":"crossref","unstructured":"Hajiaghayi, M., Kleinberg, R., Leighton, T.: Semi-oblivious routing: lower bounds. In: Proceedings of the 18th ACM-SIAM Symposium on Discrete Algorithms, pp.\u00a0929\u2013938 (2007)","DOI":"10.1145\/1148109.1148148"},{"key":"261_CR10_261","unstructured":"Hajiaghayi, M., Kleinberg, R., Leighton, T., R\u00e4cke, H.: Oblivious routing in node-capacitated and directed graphs. In: Proceedings of the 16th ACM-SIAM Symposium on Discrete Algorithms, pp.\u00a0782\u2013790 (2005)"},{"key":"261_CR11_261","doi-asserted-by":"crossref","unstructured":"Harrelson, C., Hildrum, K., Rao, S.: A\u00a0polynomial-time tree decomposition to minimize congestion. In: Proceedings of the 15th annual ACM Symposium on Parallel Algorithms and Architectures, pp.\u00a034\u201343 (2003)","DOI":"10.1145\/777412.777419"},{"key":"261_CR12_261","doi-asserted-by":"crossref","unstructured":"Kaklamanis, C., Krizanc, D., Tsantilas, T.: Tight bounds for oblivious routing in the hypercube. In: Proceedings of the 3rd annual ACM Symposium on Parallel Algorithms and Architectures, pp.\u00a031\u201336 (1991)","DOI":"10.1145\/97444.97453"},{"key":"261_CR13_261","doi-asserted-by":"crossref","unstructured":"Linial, N., London, E., Rabinovich, Y.: The geometry of graphs and some of its algorithmic applications. In: IEEE Symposium on Foundations of Computer Science, pp.\u00a0577\u2013591 (1994)","DOI":"10.1109\/SFCS.1994.365733"},{"key":"261_CR14_261","doi-asserted-by":"crossref","unstructured":"Maggs, B.M., Miller, G.L., Parekh, O., Ravi, R., Woo, S.L.M.: Finding effective support-tree preconditioners. In: Symposium on Parallel Algorithms and Architectures, pp.\u00a0176\u2013185 (2005)","DOI":"10.1145\/1073970.1073996"},{"key":"261_CR15_261","unstructured":"R\u00e4cke, H.: Minimizing congestion in general networks. In: Proceedings of the 43rd Annual Symposium on the Foundations of Computer Science, pp.\u00a043\u201352 (2002)"},{"key":"261_CR16_261","unstructured":"Vaidya, P.: Solving linear equations with symmetric diagonally dominant matrices by constructing good preconditioners. Unpublished manuscript (1991)"},{"key":"261_CR17_261","doi-asserted-by":"crossref","unstructured":"Valiant, L., Brebner, G.J.: Universal schemes for parallel communication. In: Proceedings of the 13th ACM Symposium on Theory of Computing, pp.\u00a0263\u2013277 (1981)","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_261","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T21:32:22Z","timestamp":1738272742000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-30162-4_261"}},"subtitle":["2002; R\u00e4cke"],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387307701","9780387301624"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-30162-4_261","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}