# Customizable Contraction Hierarchies

arXiv: https://arxiv.org/abs/1402.0402 · HTML: https://mlsanity.com/paper/1402.0402/

## Key facts

- Cited by 3 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 3 Feb 2014.

## Built on by (most cited first, 3 of 3)

- [Threshold Adaptation in Spiking Networks Enables Shortest Path Finding and Place Disambiguation](https://mlsanity.com/paper/2503.21795/) (2025)
- [An Empirical Survey and Benchmark of Learned Distance Indexes for Road Networks](https://mlsanity.com/paper/2602.04068/) (2026)
- [AAC: Admissible-by-Architecture Differentiable Landmark Compression for ALT](https://mlsanity.com/paper/2604.20744/) (2026)

## Abstract (arXiv)

We consider the problem of quickly computing shortest paths in weighted graphs given auxiliary data derived in an expensive preprocessing phase. By adding a fast weight-customization phase, we extend Contraction Hierarchies by Geisberger et al to support the three-phase workflow introduced by Delling et al. Our Customizable Contraction Hierarchies use nested dissection orders as suggested by Bauer et al. We provide an in-depth experimental analysis on large road and game maps that clearly shows that Customizable Contraction Hierarchies are a very practicable solution in scenarios where edge weights often change.