Approximability of unsplittable shortest path routing problems (Q3057101)
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 5818755
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximability of unsplittable shortest path routing problems |
scientific article; zbMATH DE number 5818755 |
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
0.9626334309577942
0 references
0.8165077567100525
0 references
0.8146517276763916
0 references
0.8145944476127625
0 references
0.8145944476127625
0 references
