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

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]

The following publications are possibly variants of this publication:

Hardness of the undirected congestion minimization problemMatthew Andrews, Lisa Zhang. stoc 2005: 284-293 [doi]

Hardness of the Undirected Congestion Minimization ProblemMatthew Andrews, Lisa Zhang. SICOMP, 37(1):112-131, 2007. [doi]

Almost-tight hardness of directed congestion minimizationMatthew Andrews, Lisa Zhang. JACM, 55(6), 2008. [doi]

runs on WebDSL