The minimum tollbooth problem in atomic network congestion games with unsplittable flows (Q2230724)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7402293
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The minimum tollbooth problem in atomic network congestion games with unsplittable flows |
scientific article; zbMATH DE number 7402293 |
Statements
The minimum tollbooth problem in atomic network congestion games with unsplittable flows (English)
0 references
28 September 2021
0 references
atomic network congestion games
0 references
minimum tollbooth problem
0 references
series-parallel graph
0 references
social optimum
0 references
unsplittable flow
0 references
weighted CNF SAT
0 references
0 references
0.8613951802253723
0 references
0.8504623174667358
0 references
0.8032380938529968
0 references
0.7940459251403809
0 references
0.7852604389190674
0 references
