Hardness of the undirected congestion minimization problem

14 years 4 months ago

Download ect.bell-labs.com

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.

Matthew Andrews, Lisa Zhang

Real-time Traffic

Algorithms | Log Log Log | STOC 2005 |

claim paper

» Logarithmic hardness of the directed congestion minimization problem

» Hardness of Directed Routing with Congestion

» Edgedisjoint paths in Planar graphs with constant congestion

» On the Approximability of Maximum and Minimum Edge Clique Partition Problems

» The Checkpoint Problem

» Almost Tight bounds and existence theorems for singlecommodity confluent flows

» Constraintbased local search for solving nonsimple paths problems on graphs application to...

» Resource Minimization for Fire Containment

Post Info
More Details (n/a)

Added	03 Dec 2009
Updated	03 Dec 2009
Type	Conference
Year	2005
Where	STOC
Authors	Matthew Andrews, Lisa Zhang

Comments (0)

Sciweavers

Hardness of the undirected congestion minimization problem

Algorithms | Log Log Log | STOC 2005 |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers