Contraction hierarchies

Known as: Highway hierarchy, Contraction hierarchy, Contraction

In applied mathematics, the method of contraction hierarchies is a technique to speed up shortest-path routing by first creating precomputed…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2014

2013

The problem of route optimization is significant due to the fact of the high availablity of private transport as well as the need…

2013

Many speed-up techniques developed for accelerating the computation of shortest paths in road networks, like reach or contraction…

2012

In this article an algorithm for adaptation of the artificial hierarchical division of the road network to different traffic…

2011

Hierarchical strategy is widely used in route planning algorithms to improve the computing efficiency. Hierarchical and…

2006

Considering large road networks, we are interested in finding all quickest connections between given source and target locations…

2006

Recently, Sanders and Schultes presented a shortest path algorithm, named Highway Hierarchies, for fast point-to-point shortest…

2006

This technical report considers the problem of computing distances of shortest paths between all pairs of nodes from given sets…

2005

The computation of shortest paths in a graph is a well-known problem in graph theory. One of the most obvious practical…

1992