Hardness of the Undirected Congestion Minimization Problem

We show that there is no $(loglog M)^{1-ve}$ approximation for the undirected congestion minimization problem unless $NP subseteq ZPTIME(n^{polylog~n})$, where $M$ is the size of the graph and $ve$ is any positive constant.