Optimal oblivious routing in polynomial time
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing, 2003•dl.acm.org
A recent seminal result of Racke is that for any network there is an oblivious routing
algorithm with a polylog competitive ratio with respect to congestion. Unfortunately, Racke's
construction is not polynomial time. We give a polynomial time construction that guarantee's
Racke's bounds, and more generally gives the true optimal ratio for any network.
algorithm with a polylog competitive ratio with respect to congestion. Unfortunately, Racke's
construction is not polynomial time. We give a polynomial time construction that guarantee's
Racke's bounds, and more generally gives the true optimal ratio for any network.
A recent seminal result of Racke is that for any network there is an oblivious routing algorithm with a polylog competitive ratio with respect to congestion. Unfortunately, Racke's construction is not polynomial time. We give a polynomial time construction that guarantee's Racke's bounds, and more generally gives the true optimal ratio for any network.
ACM Digital LibraryShowing the best result for this search. See all results