Using Incremental Many-to-One Queries to Build a Fast and Tight Heuristic for A* in Road Networks (Q6127839): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q130902888, #quickstatements; #temporary_batch_1733743668271 |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/3571282 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4311012214 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q130902888 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 12:30, 9 December 2024
scientific article; zbMATH DE number 7832068
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Using Incremental Many-to-One Queries to Build a Fast and Tight Heuristic for A* in Road Networks |
scientific article; zbMATH DE number 7832068 |
Statements
Using Incremental Many-to-One Queries to Build a Fast and Tight Heuristic for A* in Road Networks (English)
0 references
14 April 2024
0 references
route planning
0 references
shortest paths
0 references
realistic road networks
0 references
