Papers
Topics
Authors
Recent
Search
2000 character limit reached

Dynamic Scope-Based Dijkstra's Algorithm

Published 10 Jan 2012 in cs.DS | (1201.2000v1)

Abstract: 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.

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Authors (2)

  1. Petr Hlineny 
  2. Ondrej Moris 

Collections

Sign up for free to add this paper to one or more collections.

Sign Up