Approximability of unsplittable shortest path routing problems (Q3057101)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximability of unsplittable shortest path routing problems |
scientific article |
Statements
Approximability of unsplittable shortest path routing problems (English)
0 references
24 November 2010
0 references
shortest path routing
0 references
unsplittable flow
0 references
computational complexity
0 references
approximation
0 references
0 references
0 references
