Almost-tight hardness of directed congestion minimization.
Matthew AndrewsLisa ZhangPublished in: J. ACM (2008)
Keyphrases
- worst case
- lower bound
- upper bound
- objective function
- phase transition
- travel time
- traffic congestion
- learning theory
- ip networks
- congestion avoidance
- real time
- global minimization
- geometric interpretation
- transmission rate
- congestion control
- np complete
- np hard
- computational complexity
- neural network
- error function
- convex functions
- end to end
- special case
- traffic volume