On the Approximability of the Minimum Congestion Unsplittable Shortest Path Routing Problem (Q3596341)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the Approximability of the Minimum Congestion Unsplittable Shortest Path Routing Problem |
scientific article |
Statements
On the Approximability of the Minimum Congestion Unsplittable Shortest Path Routing Problem (English)
0 references
30 August 2007
0 references
Shortest Path Routing
0 references
Unsplittable Flow
0 references
Computational Complexity
0 references
Approximation
0 references
