Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

9 relations
AlgorithmDijkstra's algorithmGraph (abstract data type)Graph (discrete mathematics)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2020
2020
A Lower Bound for the Query Phase of Contraction Hierarchies and Hub Labels
We prove a \(\varOmega (\sqrt{n})\) lower bound on the query time for contraction hierarchies (CH) as well as hub labels, two… 
2018
2018
Optimization of the University Transportation by Contraction Hierarchies Method and Clustering Algorithms
This research work focuses on the study of different models of solution reflected in the literature, which treat the optimization… 
2015
2015
Effects of High-speed Elastic Band Training on Physical Fitness and Muscle Function in Rural Community-dwelling Elderly: a Single-blinded Randomized Controlled Trial
Background: Aging related decrease in muscle strength and flexibility leads to functional loss of physical ability. Power… 
2013
2013
Parallel hierarchies for solving single source shortest path problem
The problem of route optimization is significant due to the fact of the high availablity of private transport as well as the need… 
2013
2013
Contraction Hierarchies on Grid Graphs
Many speed-up techniques developed for accelerating the computation of shortest paths in road networks, like reach or contraction… 
2006
2006
Efficient Computation of Many-to-Many Shortest Paths
Considering large road networks, we are interested in finding all quickest connections between given source and target locations… 
2006
2006
Engineering and applications track - engineering highway hierarchies
2006
2006
Fast Computation of Distance Tables using Highway Hierarchies
This technical report considers the problem of computing distances of shortest paths between all pairs of nodes from given sets… 
2005
2005
Fast and Exact Shortest Path Queries Using Highway Hierarchies
The computation of shortest paths in a graph is a well-known problem in graph theory. One of the most obvious practical… 
1992
1992
On Combining Multiple Speedup Techniques
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)