Dynamic Scope-Based Dijkstra's Algorithm

Details Dynamic Scope-Based Dijkstra's Algorithm Dynamic Scope-Based Dijkstra's Algorithm

2012-01-10

arxiv.org/abs/1201.2000v1

Computer Science

Data Structures and Algorithms

Scientific paper

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 first motivate dynamization of the concept of scope admissibility, and then we briefly describe a modification of the scope-aware query algorithm of HM2011A to dynamic road networks. Finally, we outline our future work on this concept.

Affiliated with

Also associated with

No associations

Rating

Dynamic Scope-Based Dijkstra's Algorithm does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Dynamic Scope-Based Dijkstra's Algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dynamic Scope-Based Dijkstra's Algorithm will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-462381