GRASP. Extending graph separators for the single-source shortest-path problem

DOI10.1007/978-3-662-44777-2_30MaRDI QIDQ2921422zbMATH OpenOpenAlexFDO

Authors 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 algorithmisochronesrange queriesshortest-path computation

Mathematics Subject Classification ID

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

Recommendations

• Point-to-Point Shortest Path Algorithms with Preprocessing
• Engineering Highway Hierarchies
• Reach for A^*: shortest path algorithms with preprocessing
• Engineering highway hierarchies
• Shortest paths on dynamic graphs

Cited in

(2)

• Real-time traffic assignment using engineered customizable contraction hierarchies
• ReHub: extending hub labels for reverse k-nearest neighbor queries on large-scale networks

This page was built for publication: GRASP. Extending graph separators for the single-source shortest-path problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2921422)