On the Approximability of the Minimum Congestion Unsplittable Shortest Path Routing Problem (Q3596341): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/11496915_8 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1482811544 / rank | |||
Normal rank | |||
Latest revision as of 02:27, 20 March 2024
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
