Time Dependent Contraction Hierarchies -- Basic Algorithmic Ideas
Data Structures and Algorithms
2008-12-18 v1
Abstract
Contraction hierarchies are a simple hierarchical routing technique that has proved extremely efficient for static road networks. We explain how to generalize them to networks with time-dependent edge weights. This is the first hierarchical speedup technique for time-dependent routing that allows bidirectional query algorithms.
Keywords
Cite
@article{arxiv.0804.3947,
title = {Time Dependent Contraction Hierarchies -- Basic Algorithmic Ideas},
author = {Peter Sanders},
journal= {arXiv preprint arXiv:0804.3947},
year = {2008}
}