Escaping Braess's paradox through approximate Caratheodory's theorem (Q2094366)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Escaping Braess's paradox through approximate Caratheodory's theorem |
scientific article; zbMATH DE number 7609041
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Escaping Braess's paradox through approximate Caratheodory's theorem |
scientific article; zbMATH DE number 7609041 |
Statements
Escaping Braess's paradox through approximate Caratheodory's theorem (English)
0 references
28 October 2022
0 references
Braess paradox
0 references
congestion games
0 references
selfish routing
0 references
best subnetwork
0 references
approximation algorithms
0 references
0 references
