On the Approximability of the Minimum Congestion Unsplittable Shortest Path Routing Problem (Q3596341)
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: On the Approximability of the Minimum Congestion Unsplittable Shortest Path Routing Problem |
scientific article; zbMATH DE number 5185460
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the Approximability of the Minimum Congestion Unsplittable Shortest Path Routing Problem |
scientific article; zbMATH DE number 5185460 |
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
0.9626334309577942
0 references
0.8326728940010071
0 references
0.8153037428855896
0 references
0.8093184232711792
0 references
