Polynomial-time Construction of Contraction Hierarchies for Multi-criteria Objectives

DOI10.1137/1.9781611972931.4zbMath1430.68205OpenAlexW2262197264MaRDI QIDQ5232447

Stefan Funke, Sabine Storandt

Publication date: 12 September 2019

Published in: 2013 Proceedings of the Fifteenth Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611972931.4

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10)

Related Items (6)

Search-space size in contraction hierarchies ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Non-additive shortest path in the context of traffic assignment ⋮ Modeling and Engineering Constrained Shortest Path Algorithms for Battery Electric Vehicles

This page was built for publication: Polynomial-time Construction of Contraction Hierarchies for Multi-criteria Objectives