Sciweavers

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

7

ALENEX
2007

favoriteEmaildiscussreport

86views Algorithms» more ALENEX 2007»

In Transit to Constant Time Shortest-Path Queries in Road Networks

13 years 5 months ago

In Transit to Constant Time Shortest-Path Queries in Road Networks

Download algo2.iti.kit.edu

Holger Bast, Stefan Funke, Domagoj Matijevic, Pete

Real-time Traffic

ALENEX 2007 | Algorithms |

claim paper

Related Content

» Finding timedependent shortest paths over large graphs

» Highway Hierarchies Hasten Exact Shortest Path Queries

» Improved decremental algorithms for maintaining transitive closure and allpairs shortest p...

» Better Landmarks Within Reach

» A Space Saving Trick for Directed Dynamic Transitive Closure and Shortest Path Algorithms

» Levelwise Mesh Sparsification for Shortest Path Queries

» Route Planning with Flexible Objective Functions

» Monitoring path nearest neighbor in road networks

» Efficient Verification of Shortest Path Search via Authenticated Hints

Post Info
More Details (n/a)

Added	29 Oct 2010
Updated	29 Oct 2010
Type	Conference
Year	2007
Where	ALENEX
Authors	Holger Bast, Stefan Funke, Domagoj Matijevic, Peter Sanders, Dominik Schultes

Comments (0)