Point-to-Point Shortest Path Algorithms with Preprocessing
From MaRDI portal
Publication:5448767
DOI10.1007/978-3-540-69507-3_6zbMath1131.68523OpenAlexW1487146975MaRDI QIDQ5448767
Publication date: 7 March 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-69507-3_6
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items
Non-Crossing Shortest Paths in Undirected Unweighted Planar Graphs in Linear Time ⋮ Tree decomposition-based indexing for efficient shortest path and nearest neighbors query answering on graphs ⋮ Floyd-A algorithm solving the least-time itinerary planning problem in urban scheduled public transport network ⋮ Acceleration of the A*-Algorithm for the Shortest Path Problem in Digital Road Maps ⋮ Shortest-path queries in static networks ⋮ Efficient distributed computation of distance sketches in networks ⋮ Non-crossing shortest paths in undirected unweighted planar graphs in linear time
This page was built for publication: Point-to-Point Shortest Path Algorithms with Preprocessing