GRASP. Extending Graph Separators for the Single-Source Shortest-Path Problem

DOI10.1007/978-3-662-44777-2_30zbMath1423.68336OpenAlexW2234917253MaRDI QIDQ2921422

Alexandros Efentakis, Dieter Pfoser

Publication date: 8 October 2014

Published in: Algorithms - ESA 2014 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-44777-2_30

zbMATH Keywords

GRASP algorithmrange queriesisochronesshortest-path computation

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Real-time Traffic Assignment Using Engineered Customizable Contraction Hierarchies, ReHub