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 graph and is some positive constant.

• Type: Conference
• Year: 2005
• Where: STOC
• Authors: Matthew Andrews, Lisa Zhang
• Keywords: Algorithms, Log Log Log, STOC 2005