Logarithmic hardness of the directed congestion minimization problem

Matthew Andrews, Lisa Zhang. Logarithmic hardness of the directed congestion minimization problem. In Jon M. Kleinberg, editor, Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, USA, May 21-23, 2006. pages 517-526, ACM, 2006. [doi]

Abstract

Abstract is missing.