On the complexity of time-dependent shortest paths (Q476455)
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 6375651
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of time-dependent shortest paths |
scientific article; zbMATH DE number 6375651 |
Statements
On the complexity of time-dependent shortest paths (English)
0 references
2 December 2014
0 references
time-dependent shortest path
0 references
piecewise linear delay functions
0 references
parametric shortest path
0 references
approximation algorithms
0 references
0 references
0.9959800839424132
0 references
0.8682042360305786
0 references
0.8549253940582275
0 references
0.8542628288269043
0 references
0.8317549228668213
0 references
