Personal routes with high-dimensional costs and dynamic approximation guarantees

DOI10.4230/LIPICS.SEA.2017.18zbMATH Open1432.68353OpenAlexW2752656571MaRDI QIDQ4580167FDOQ4580167

Authors: Stefan Funke, Sören Laue, Sabine Storandt 

Publication date: 13 August 2018

Full work available at URL: https://doi.org/10.4230/LIPIcs.SEA.2017.18

Recommendations

• Route planning with flexible objective functions
• Time-dependent route planning with generalized objective functions
• User-Constrained Multi-Modal Route Planning
• Analysis and Experimental Evaluation of Time-Dependent Distance Oracles
• Engineering highway hierarchies

zbMATH Keywords

contraction hierarchieslinear programapproximate queriesseparation oraclepersonalized route planning

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Data structures (68P05)

Cited In (1)

• Route planning with flexible objective functions

This page was built for publication: Personal routes with high-dimensional costs and dynamic approximation guarantees

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