Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

41

CORR
2008
Springer

favoriteEmaildiscussreport

96views Education» more CORR 2008»

Time Dependent Contraction Hierarchies -- Basic Algorithmic Ideas

13 years 11 months ago

Time Dependent Contraction Hierarchies -- Basic Algorithmic Ideas

Download algo2.iti.kit.edu

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.

Peter Sanders

Real-time Traffic

CORR 2008 | Education | Hierarchical Routing Technique | Hierarchical Speedup Technique | Time-dependent Edge Weights |

claim paper

Related Content

» Distributed TimeDependent Contraction Hierarchies

» Component Based MiddlewareSynthesis for AUTOSAR Basic Software

» Visual analytics of time dependent 2D point clouds

» Resource Scheduling in Dependable Integrated Modular Avionics

» Hardware for Speculative RunTime Parallelization in Distributed SharedMemory Multiprocesso...

» TimeDelayARACNE Reverse engineering of gene networks from timecourse data by an informatio...

» Combining analysis and synthesis in a model of a biological cell

» Hierarchical Pixel Bar Charts

» Highly Dynamic DestinationSequenced DistanceVector Routing DSDV for mobile computers

Post Info
More Details (n/a)

Added	09 Dec 2010
Updated	09 Dec 2010
Type	Journal
Year	2008
Where	CORR
Authors	Peter Sanders

Comments (0)