The Shortest-Path Problem: Analysis and Comparison of Methods
DOI10.2200/S00618ED1V01Y201412TCS001zbMath1321.90006OpenAlexW2164399552MaRDI QIDQ5255986
Hector Ortega-Arranz, Diego R. Llanos, Arturo González-Escribano
Publication date: 22 June 2015
Published in: Synthesis Lectures on Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2200/s00618ed1v01y201412tcs001
graph algorithmsshortest path problemgraph searchDijkstra's algorithm\(A^*\) algorithmnon-hierarchical approachespreprocessing-dependent approaches, hierarchical approaches
Programming involving graphs or networks (90C35) Analysis of algorithms (68W40) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (1)
This page was built for publication: The Shortest-Path Problem: Analysis and Comparison of Methods
