Optimal oblivious routing in polynomial time

Yossi Azar*, Edith Cohen, Amos Fiat, Haim Kaplan, Harald Räcke

*Corresponding author for this work

Research output: Contribution to journalConference articlepeer-review


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.

Original languageEnglish
Pages (from-to)383-388
Number of pages6
JournalConference Proceedings of the Annual ACM Symposium on Theory of Computing
StatePublished - 2003
Event35th Annual ACM Symposium on Theory of Computing - San Diego, CA, United States
Duration: 9 Jun 200311 Jun 2003


  • Ellipsoid algorithm
  • Oblivious routing


Dive into the research topics of 'Optimal oblivious routing in polynomial time'. Together they form a unique fingerprint.

Cite this