Transit Nodes – Lower Bounds and Refined Construction

DOI10.1137/1.9781611972924.14zbMath1430.90180OpenAlexW4205208191MaRDI QIDQ5233726

Jochen Eisner, Stefan Funke

Publication date: 12 September 2019

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

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

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Traffic problems in operations research (90B20)

Related Items (2)

A Lower Bound for the Query Phase of Contraction Hierarchies and Hub Labels ⋮ Sublinear search spaces for shortest path planning in grid and road networks

This page was built for publication: Transit Nodes – Lower Bounds and Refined Construction