{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,16]],"date-time":"2026-10-16T00:44:34Z","timestamp":1792111474750,"version":"4.4.0"},"publisher-location":"New York, NY","reference-count":13,"publisher":"Springer New York","isbn-type":[{"value":"9781493928637","type":"print"},{"value":"9781493928644","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-1-4939-2864-4_261","type":"book-chapter","created":{"date-parts":[[2016,4,21]],"date-time":"2016-04-21T20:04:14Z","timestamp":1461269054000},"page":"1426-1430","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Oblivious Routing"],"prefix":"10.1007","author":[{"given":"Nikhil","family":"Bansal","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,4,22]]},"reference":[{"key":"261_CR1525","unstructured":"Alon N, Awerbuch B, Azar Y, Buchbinder N, Naor J (2004) A general approach to online network optimization problems. In: Symposium on discrete algorithms, pp\u00a0570\u2013579"},{"key":"261_CR1526","first-page":"313","volume-title":"Making intra-domain routing robust to changing and uncertain traffic demands: understanding fundamental tradeoffs","author":"D Applegate","year":"2003","unstructured":"Applegate D, Cohen E (2003) Making intra-domain routing robust to changing and uncertain traffic demands: understanding fundamental tradeoffs. In: SIGCOMM, pp\u00a0313\u2013324"},{"issue":"1","key":"261_CR1527","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1137\/S0097539794285983","volume":"27","author":"Y Aumann","year":"1998","unstructured":"Aumann Y, Rabani Y (1998) An O(log k) approximate min-cut max-flow theorem and approximation algorithm. SIAM J Comput 27(1):291\u2013301","journal-title":"SIAM J Comput"},{"key":"261_CR1528","doi-asserted-by":"crossref","unstructured":"Azar Y, Cohen E, Fiat A, Kaplan H, R\u00e4cke H (2003) Optimal oblivious routing in polynomial time. In: Proceedings of the 35th ACM symposium on the theory of computing, pp\u00a0383\u2013388","DOI":"10.1145\/780542.780599"},{"key":"261_CR1529","first-page":"44","volume-title":"Symposium on parallelism in algorithms and architectures","author":"N Bansal","year":"2003","unstructured":"Bansal N, Blum A, Chawla S, Meyerson A (2003) Online oblivious routing. In: Symposium on parallelism in algorithms and architectures, pp\u00a044\u201349"},{"issue":"1","key":"261_CR1530","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 (1985) Routing, merging and sorting on parallel models of computation. J Comput Syst Sci 10(1):130\u2013145","journal-title":"J Comput Syst Sci"},{"key":"261_CR1531","doi-asserted-by":"crossref","unstructured":"Hajiaghayi M, Kim JH, Leighton T, R\u00e4cke H (2005) Oblivious routing in directed graphs with random demands. In: Symposium on theory of computing, pp\u00a0193\u2013201","DOI":"10.1145\/1060590.1060619"},{"key":"261_CR1532","unstructured":"Hajiaghayi M, Kleinberg R, Leighton T (2007) Semi-oblivious routing: lower bounds. In: Proceedings of the 18th ACM-SIAM symposium on discrete algorithms, pp\u00a0929\u2013938"},{"key":"261_CR1533","doi-asserted-by":"crossref","unstructured":"Harrelson C, Hildrum K, Rao S (2003) A polynomial-time tree decomposition to minimize congestion. In: Proceedings of the 15th annual ACM symposium on parallel algorithms and architectures, pp\u00a034\u201343","DOI":"10.1145\/777412.777419"},{"key":"261_CR1534","doi-asserted-by":"crossref","unstructured":"Kaklamanis C, Krizanc D, Tsantilas T (1991) Tight bounds for oblivious routing in the hypercube. In: Proceedings of the 3rd annual ACM symposium on parallel algorithms and architectures, pp\u00a031\u201336","DOI":"10.1145\/97444.97453"},{"key":"261_CR1535","doi-asserted-by":"crossref","unstructured":"R\u00e4cke H (2002) Minimizing congestion in general networks. In: Proceedings of the 43rd annual symposium on the foundations of computer science, pp\u00a043\u201352","DOI":"10.1109\/SFCS.2002.1181881"},{"key":"261_CR1536","doi-asserted-by":"crossref","unstructured":"R\u00e4cke H (2008) Optimal hierarchical decompositions for congestion minimization networks. In: Symposium on theory of computing, pp\u00a0255\u2013264","DOI":"10.1145\/1374376.1374415"},{"key":"261_CR1537","doi-asserted-by":"crossref","unstructured":"Valiant L, Brebner GJ (1981) Universal schemes for parallel communication. In: Proceedings of the 13th ACM symposium on theory of computing, 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-1-4939-2864-4_261","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,10,15]],"date-time":"2026-10-15T23:54:43Z","timestamp":1792108483000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/chapter\/10.1007\/978-1-4939-2864-4_261"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9781493928637","9781493928644"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-1-4939-2864-4_261","relation":{},"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}