Reach for \(A^*\): shortest path algorithms with preprocessing (Q3574264)
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: Reach for A^*: shortest path algorithms with preprocessing |
scientific article; zbMATH DE number 5734724
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Reach for \(A^*\): shortest path algorithms with preprocessing |
scientific article; zbMATH DE number 5734724 |
Statements
9 July 2010
0 references
source-to-destination queries
0 references
shortcuts
0 references
landmark-based \(A^*\) search
0 references
0.9478943347930908
0 references
0.8976984024047852
0 references
0.8630050420761108
0 references
0.8364209532737732
0 references
0.8220013380050659
0 references
