Anzeige
Erschienen in:
2014 | OriginalPaper | Buchkapitel
Customizable Contraction Hierarchies
verfasst von : Julian Dibbelt, Ben Strasser, Dorothea Wagner
Erschienen in: Experimental Algorithms
Verlag: Springer International Publishing
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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 [12] to support the three-phase workflow introduced by Delling et al. [6]. Our Customizable Contraction Hierarchies use nested dissection orders as suggested in [3]. 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.