Engineering Time-dependent One-To-All Computation

Details Engineering Time-dependent One-To-All Computation Engineering Time-dependent One-To-All Computation

2010-10-05

arxiv.org/abs/1010.0809v1

Computer Science

Data Structures and Algorithms

7 pages, technical report

Scientific paper

Very recently a new algorithm to the nonnegative single-source shortest path problem on road networks has been discovered. It is very cache-efficient, but only on static road networks. We show how to augment it to the time-dependent scenario. The advantage if the new approach is that it settles nodes, even for a profile query, by scanning all downward edges. We improve the scanning of the downward edges with techniques developed for time-dependent many-to-many computations.

Affiliated with

Also associated with

No associations

Rating

Engineering Time-dependent One-To-All Computation 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 Engineering Time-dependent One-To-All Computation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Engineering Time-dependent One-To-All Computation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-86346