Inapproximability results for the inverse shortest paths problem with integer lengths and unique shortest paths (Q3593366): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/net.20163 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4242097656 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4363164 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
Latest revision as of 12:37, 26 June 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
