Shortest paths

0Citations
Citations of this article
196Readers
Mendeley users who have this article in their library.
Get full text

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. © 2011 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

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

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free