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.
|Number of pages||6|
|Journal||Conference Proceedings of the Annual ACM Symposium on Theory of Computing|
|State||Published - 2003|
|Event||35th Annual ACM Symposium on Theory of Computing - San Diego, CA, United States|
Duration: 9 Jun 2003 → 11 Jun 2003
- Ellipsoid algorithm
- Oblivious routing