Inapproximability results for the inverse shortest paths problem with integer lengths and unique shortest paths (Q3593366)
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 5173294
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Inapproximability results for the inverse shortest paths problem with integer lengths and unique shortest paths |
scientific article; zbMATH DE number 5173294 |
Statements
Inapproximability results for the inverse shortest paths problem with integer lengths and unique shortest paths (English)
0 references
20 July 2007
0 references
inverse shortest paths
0 references
computational complexity
0 references
approximation algorithms
0 references
shortest path routing
0 references
0.90925705
0 references
0.9018351
0 references
0.87683886
0 references
0.8689853
0 references
0.8646958
0 references
0.85317165
0 references
