Time Dependent Contraction Hierarchies -- Basic Algorithmic Ideas

Simple item page
dc.creatorSanders, Peter
dc.date2008-04-24
dc.date.accessioned2026-07-07T12:18:28Z
dc.date.available2026-07-07T12:18:28Z
dc.descriptionContraction 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.
dc.identifierhttps://arxiv.org/abs/0804.3947
dc.identifierhttp://arxiv.org/abs/0804.3947
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/212422
dc.subjectData Structures and Algorithms
dc.subjectG.2.2
dc.titleTime Dependent Contraction Hierarchies -- Basic Algorithmic Ideas
dc.typetext

Files

Collections

arXiv