Polynomial-time construction of contraction hierarchies for multi-criteria objectives

@inproceedings{Funke2013PolynomialtimeCO,
  title={Polynomial-time construction of contraction hierarchies for multi-criteria objectives},
  author={Stefan Funke and Sabine Storandt},
  booktitle={ALENEX},
  year={2013}
}
In this paper we consider a variant of the multi-criteria shortest path problem where the different criteria are combined in an arbitrary conic combination at query time. We show that contraction hierarchies (CH) a very powerful speedup technique originally developed for standard shortest path queries (Geisberger et al. 2008) can be adapted to this scenario and lead after moderate preprocessing effort to query times that are orders of magnitudes faster than standard shortest path approaches. On… CONTINUE READING
Highly Cited
This paper has 29 citations. REVIEW CITATIONS