The Shortest-Path Problem Analysis and Comparison of Methods |
|
| Author:
| Ortega-Arranz, Hector
Llanos, Diego R.
Gonzalez-Escribano, Arturo |
| Series title: | Synthesis Lectures on Computer Science Ser. |
| ISBN: | 978-1-62705-539-0 |
| Publication Date: | Dec 2014 |
| Publisher: | Morgan & Claypool Publishers
|
| Book Format: | Paperback |
| List Price: | USD $55.00 |
Book Description:
|
Many applications in different domains need to calculate the shortest-path between two points in a graph. This title describes this shortest path problem in detail, starting with the classic Dijkstra's algorithm and moving to more advanced solutions that are currently applied to road network routing, including the use of heuristics and precomputation techniques.
Many applications in different domains need to calculate the shortest-path between two points in a graph. This title describes this shortest path problem in detail, starting with the classic Dijkstra's algorithm and moving to more advanced solutions that are currently applied to road network routing, including the use of heuristics and precomputation techniques.