Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Sanders, P., Singler, J. (2011). Shortest Paths. In: Vöcking, B., et al. Algorithms Unplugged. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15328-0_32
Download citation
DOI: https://doi.org/10.1007/978-3-642-15328-0_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15327-3
Online ISBN: 978-3-642-15328-0
eBook Packages: Computer ScienceComputer Science (R0)