Hardness of the Undirected Congestion Minimization Problem

We show that there is no $\gamma\log\log M/\log\log\log M$-approximation for the undirected congestion minimization problem unless $NP \subseteq ZPTIME(n^{{\rm polylog} n})$, where $M$ is the size of the graph and g is some positive constant.