K\(^{\ast}\): A heuristic search algorithm for finding the \(k\) shortest paths (Q420803)
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: K\(^{\ast}\): A heuristic search algorithm for finding the \(k\) shortest paths |
scientific article; zbMATH DE number 6037785
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | K\(^{\ast}\): A heuristic search algorithm for finding the \(k\) shortest paths |
scientific article; zbMATH DE number 6037785 |
Statements
K\(^{\ast}\): A heuristic search algorithm for finding the \(k\) shortest paths (English)
0 references
23 May 2012
0 references
\(k\)-shortest-paths problem
0 references
K\(^{\ast}\)
0 references
heuristic search
0 references
on-the-fly search
0 references
