Quickest path queries on transportation network

DOI10.1016/j.comgeo.2014.01.004zbMath1291.90035arXiv1012.0634MaRDI QIDQ2249042

Christos Levcopoulos, Radwa El Shawi, Joachim Gudmundsson

Publication date: 27 June 2014

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1012.0634

zbMATH Keywords

shortest path; computational geometry; approximation algorithms; transport networks

Mathematics Subject Classification ID

90B06: Transportation, logistics and supply chain management

90B10: Deterministic network models in operations research

Cites Work

• Unnamed Item
• A note on two problems in connexion with graphs
• Ordered theta graphs
• Voronoi diagram for services neighboring a highway
• An algorithmic approach to some problems in terrain navigation
• Quickest paths, straight skeletons, and the city Voronoi diagram
• Geometric Spanner Networks
• CONSTRUCTING THE CITY VORONOI DIAGRAM FASTER
• OPTIMAL CONSTRUCTION OF THE CITY VORONOI DIAGRAM
• Path Planning in 0/1/∞ Weighted Regions with Applications
• Efficient Algorithms for Shortest Paths in Sparse Networks
• The weighted region problem
• A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fields
• VORONOI DIAGRAMS FOR A TRANSPORTATION NETWORK ON THE EUCLIDEAN PLANE
• Algorithms and Computation