Sciweavers

Share
WINE
2010
Springer

Braess's Paradox in Large Sparse Graphs

9 years 5 months ago
Braess's Paradox in Large Sparse Graphs
Braess's paradox, in its original context, is the counter-intuitive observation that, without lessening demand, closing roads can improve traffic flow. With the explosion of distributed (selfish) routing situations understanding this paradox has become an important concern in a broad range of network design situations. However, the previous theoretical work on Braess's paradox has focused on "designer" graphs or dense graphs, which are unrealistic in practical situations. In this work, we exploit the expansion properties of Erdos-R
Fan Chung, Stephen J. Young
Added 15 Feb 2011
Updated 15 Feb 2011
Type Journal
Year 2010
Where WINE
Authors Fan Chung, Stephen J. Young
Comments (0)
books