Time Dependent Contraction Hierarchies -- Basic Algorithmic Ideas

Details Time Dependent Contraction Hierarchies -- Basic Algorithmic Ideas Time Dependent Contraction Hierarchies -- Basic Algorithmic Ideas

2008-04-24

arxiv.org/abs/0804.3947v1

Computer Science

Data Structures and Algorithms

Scientific paper

Contraction hierarchies are a simple hierarchical routing technique that has
proved extremely efficient for static road networks. We explain how to
generalize them to networks with time-dependent edge weights. This is the first
hierarchical speedup technique for time-dependent routing that allows
bidirectional query algorithms.

Affiliated with

Also associated with

No associations

Rating

Time Dependent Contraction Hierarchies -- Basic Algorithmic Ideas 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 Time Dependent Contraction Hierarchies -- Basic Algorithmic Ideas, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Time Dependent Contraction Hierarchies -- Basic Algorithmic Ideas will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-505551