Sciweavers

SODA
2004
ACM
118views Algorithms» more  SODA 2004»
13 years 6 months ago
The maximum latency of selfish routing
We give several new upper and lower bounds on the worst-case severity of Braess's Paradox and the price of anarchy of selfish routing with respect to the maximum latency obje...
Tim Roughgarden