TY - JOUR
T1 - Optimal oblivious routing in polynomial time
AU - Azar, Yossi
AU - Cohen, Edith
AU - Fiat, Amos
AU - Kaplan, Haim
AU - Räcke, Harald
N1 - Funding Information:
·Corresponding author. E-mail addresses: [email protected] (Y. Azar), [email protected] (E. Cohen), [email protected] (A. Fiat), [email protected] (H. Kaplan), [email protected] (H. Ra.cke). 1Research supported in part by the Israel Science Foundation and by the IST Program of the EU.
PY - 2003
Y1 - 2003
N2 - A recent seminal result of Räcke is that for any network there is an oblivious routing algorithm with a polylog competitive ratio with respect to congestion. Unfortunately, Räcke's construction is not polynomial time. We give a poly-nomial time construction that guarantee's Räcke's bounds, and more generally gives the true optimal ratio for any network.
AB - A recent seminal result of Räcke is that for any network there is an oblivious routing algorithm with a polylog competitive ratio with respect to congestion. Unfortunately, Räcke's construction is not polynomial time. We give a poly-nomial time construction that guarantee's Räcke's bounds, and more generally gives the true optimal ratio for any network.
KW - Ellipsoid algorithm
KW - Oblivious routing
UR - http://www.scopus.com/inward/record.url?scp=0038446975&partnerID=8YFLogxK
U2 - 10.1145/780596.780599
DO - 10.1145/780596.780599
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.conferencearticle???
AN - SCOPUS:0038446975
SN - 0734-9025
SP - 383
EP - 388
JO - Conference Proceedings of the Annual ACM Symposium on Theory of Computing
JF - Conference Proceedings of the Annual ACM Symposium on Theory of Computing
T2 - 35th Annual ACM Symposium on Theory of Computing
Y2 - 9 June 2003 through 11 June 2003
ER -