Customizable Contraction Hierarchies release_3kecqjax6fdm5df2sm2kp2v7am

by Julian Dibbelt, Ben Strasser, Dorothea Wagner

Released as a article .

2014  

Abstract

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.
In text/plain format

Archived Files and Locations

application/pdf  836.7 kB
file_eplrzhmppnbubcg7qfzai7evh4
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2014-02-05
Version   v2
Language   en ?
arXiv  1402.0402v2
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 2f7e7ede-0683-4f38-b7bc-b8da777c4e5e
API URL: JSON