Advertisement

Shortest Paths

  • Peter Sanders
  • Johannes Singler

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.

Keywords

Short Path Travelling Salesman Problem Priority Queue Travelling Salesman Thread Length 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Peter Sanders
    • 1
  • Johannes Singler
    • 1
  1. 1.Karlsruher Institut für TechnologieKarlsruheGermany

Personalised recommendations