Logarithmic hardness of the directed congestion minimization problem - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Matthew Andrews' in GoogleThis author has not been identified. Look up 'Lisa Zhang' in Google

runs on WebDSL