How can we find the shortest way to go from one location to another? For many optimization problems very tricky algorithms are known that produce an optimal solution very quickly, and this problem is one of them. In this chapter the authors present the algorithm, and explain how the technique can be extended to other types of problems. © 2011 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Sanders, P., & Singler, J. (2011). Shortest paths. In Algorithms Unplugged (pp. 317–324). Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-15328-0_32
Mendeley helps you to discover research relevant for your work.