Logarithmic hardness of the directed congestion minimization problem.
Matthew AndrewsLisa ZhangPublished in: STOC (2006)
Keyphrases
- worst case
- objective function
- np hard
- phase transition
- congestion avoidance
- geometric interpretation
- real time
- computational complexity
- congestion control
- np complete
- minimization problems
- ip networks
- information systems
- neural network
- global minimization
- real time traffic
- hopf bifurcation
- transmission rate
- np hardness
- traffic congestion
- travel time
- road network
- case study