# Contraction hierarchies

## Papers overview

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

2014

2014

- SEA
- 2014

We consider the problem of quickly computing shortest paths in weighted graphs. Often, this is achieved in two phases: 1) deriveâ€¦Â (More)

Is this relevant?

2013

2013

- KI
- 2013

Many speed-up techniques developed for accelerating the computation of shortest paths in road networks, like reach or contractionâ€¦Â (More)

Is this relevant?

2013

2013

- ACM Journal of Experimental Algorithmics
- 2013

Time-dependent road networks are represented as weighted graphs, where the weight of an edge depends on the time one passesâ€¦Â (More)

Is this relevant?

Highly Cited

2012

Highly Cited

2012

- Transportation Science
- 2012

C hierarchies are a simple approach for fast routing in road networks. Our algorithm calculates exact shortest paths and handlesâ€¦Â (More)

Is this relevant?

2012

2012

- CTS@SIGSPATIAL
- 2012

For some graph classes, most notably real-world road networks, shortest path queries can be answered very efficiently if theâ€¦Â (More)

Is this relevant?

2010

2010

- SEA
- 2010

Server based route planning in road networks is now powerful enough to find quickest paths in a matter of milliseconds, even ifâ€¦Â (More)

Is this relevant?

2010

2010

- SEA
- 2010

Time-dependent Contraction Hierarchies provide fast and exact route planning for time-dependent large scale road networks butâ€¦Â (More)

Is this relevant?

Highly Cited

2009

Highly Cited

2009

- ALENEX
- 2009

Contraction hierarchies are a simple hierarchical routing technique that has proved extremely efficient for static road networksâ€¦Â (More)

Is this relevant?

2009

2009

- 2009

Time-Dependent Contraction Hierarchies is a routing technique that solves the shortest path problem in graphs with time-dependentâ€¦Â (More)

Is this relevant?

Highly Cited

2008

Highly Cited

2008

- WEA
- 2008

We present a route planning technique solely based on the concept of node contraction. We contract or remove one node at a timeâ€¦Â (More)

Is this relevant?