Using Incremental Many-to-One Queries to Build a Fast and Tight Heuristic for A* in Road Networks

DOI10.1145/3571282OpenAlexW4311012214MaRDI QIDQ6127839

Tim Zeitz, Ben Strasser

Publication date: 14 April 2024

Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3571282

zbMATH Keywords

shortest pathsroute planningrealistic road networks

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

This page was built for publication: Using Incremental Many-to-One Queries to Build a Fast and Tight Heuristic for A* in Road Networks