@inproceedings{18966,
  abstract     = {{A recent seminal result of Räcke is that for any undirected network there is an oblivious routing algorithm with a polylogarithmic competitive ratio with respect to congestion. Unfortunately, Räcke's construction is not polynomial time. We give a polynomial time construction that guarantees Räcke's bounds, and more generally gives the true optimal ratio for any (undirected or directed) network.}},
  author       = {{Azar, Yossi and Cohen, Edith and Fiat, Amos and Kaplan, Haim and Racke, Harald}},
  booktitle    = {{Proceedings of the thirty-fifth ACM symposium on Theory of computing  - STOC '03}},
  isbn         = {{1581136749}},
  title        = {{{Optimal oblivious routing in polynomial time}}},
  doi          = {{10.1145/780542.780599}},
  year         = {{2003}},
}