Stronger Bounds on Braess's Paradox and the Maximum Latency of Selfish Routing (Q3225146): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/090769600 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2135149577 / rank | |||
Normal rank | |||
Latest revision as of 21:43, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Stronger Bounds on Braess's Paradox and the Maximum Latency of Selfish Routing |
scientific article |
Statements
Stronger Bounds on Braess's Paradox and the Maximum Latency of Selfish Routing (English)
0 references
15 March 2012
0 references
Braess's paradox
0 references
selfish routing
0 references
price of anarchy
0 references
traffic networks
0 references
approximation algorithms
0 references
