Sciweavers

Share
CORR
2008
Springer

Time Dependent Contraction Hierarchies -- Basic Algorithmic Ideas

8 years 2 months ago
Time Dependent Contraction Hierarchies -- Basic Algorithmic Ideas
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.
Peter Sanders
Added 09 Dec 2010
Updated 09 Dec 2010
Type Journal
Year 2008
Where CORR
Authors Peter Sanders
Comments (0)
books