Sciweavers

STOC
2005
ACM
135views Algorithms» more  STOC 2005»
14 years 12 months ago
Hardness of the undirected congestion minimization problem
We show that there is no log log M log log log M -approximation for the undirected congestion minimization problem unless NP ZPTIME(npolylog n ), where M is the size of the grap...
Matthew Andrews, Lisa Zhang