On the complexity of shortest path problems on discounted cost graphs (Q4910440)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the complexity of shortest path problems on discounted cost graphs |
scientific article; zbMATH DE number 6145856
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of shortest path problems on discounted cost graphs |
scientific article; zbMATH DE number 6145856 |
Statements
On the Complexity of Shortest Path Problems on Discounted Cost Graphs (English)
0 references
18 March 2013
0 references
0.7519294619560242
0 references
0.75186687707901
0 references
0.7464501261711121
0 references
0.731217086315155
0 references
