A lower bound for the quickest path problem (Q337093)
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: A lower bound for the quickest path problem |
scientific article; zbMATH DE number 6650692
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A lower bound for the quickest path problem |
scientific article; zbMATH DE number 6650692 |
Statements
A lower bound for the quickest path problem (English)
0 references
10 November 2016
0 references
quickest path problem
0 references
Dijkstra's algorithm
0 references
\(\mathrm{A}^\ast\) algorithm
0 references
0.96382564
0 references
0.8954829
0 references
0 references
0.88613605
0 references
0.8828311
0 references
0.8809157
0 references
0.88074565
0 references
0 references
