Optimal oblivious routing in polynomial time.

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

Published in: J. Comput. Syst. Sci. (2004)

Keyphrases

worst case
special case
optimal solution
database
dynamic programming
routing algorithm
computational complexity
lower bound
routing protocol
approximation algorithms
routing problem
np hardness
min sum