Oblivious routing in directed graphs with random demands

Mohammad Taghi Hajiaghayi, Jeong Han Kim, Tom Leighton, Harald Räcke. Oblivious routing in directed graphs with random demands. In Harold N. Gabow, Ronald Fagin, editors, Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, May 22-24, 2005. pages 193-201, ACM, 2005. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.