Inapproximability results for the inverse shortest paths problem with integer lengths and unique shortest paths (Q3593366): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 04:25, 5 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Inapproximability results for the inverse shortest paths problem with integer lengths and unique shortest paths |
scientific article |
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
