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

From MaRDI portal

Revision as of 06:28, 10 July 2024 by Import240710060729 (talk | contribs) (Created automatically from import240710060729)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:6127839

Jump to:navigation, search

DOI10.1145/3571282OpenAlexW4311012214WikidataQ130902888 ScholiaQ130902888MaRDI 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 paths route planning realistic 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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:6127839&oldid=35586810"