3 citations · 4 across the 3 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2012
Dynamic Scope-Based Dijkstra's Algorithm
Petr Hlineny, Ondrej Moris
We briefly report on the current state of a new dynamic algorithm for the route planning problem based on a concept of scope (the static variant presented at ESA'11, HM2011A). We f…
cs.DS2011★ 1 cited
Generalized Maneuvers in Route Planning
Petr Hlineny, Ondrej Moris
We study an important practical aspect of the route planning problem in real-world road networks -- maneuvers. Informally, maneuvers represent various irregularities of the road ne…
cs.DS2011★ 3 cited
Multi-Stage Improved Route Planning Approach: theoretical foundations
Petr Hlineny, Ondrej Moris
A new approach to the static route planning problem, based on a multi-staging concept and a \emph{scope} notion, is presented. The main goal (besides implied efficiency of planning…