Campus Event Calendar
Event Entry
New for: D1, D2
What and Who
Ultrafast Shortest-Path Queries via Transit Nodes
Holger Bast
Max-Planck-Institut für Informatik - D1
AG1 Mittagsseminar (own work)
AG 1, AG 3, AG 5, RG2, AG 2, AG 4, RG1, SWS
Public Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Wednesday, 21 March 2007
14:00
30 Minutes
E1 4
023
Saarbrücken
Abstract
The talk is about preprocessing road networks such that subsequent shortest-path queries (single source, single target) can be computed fast.
I will present a simple idea with the help of which the already quite fast query times of previous work can be improved by another two orders of magnitude.
The talk is supposed to be understandable for a general audience.
The basic concepts are very intuitive and easily stated, yet quite deep. I will explain them by giving a lot of (live) examples.
Contact
Holger Bast
--email hidden
passcode not visible
logged in users only
Holger Bast, 03/21/2007 05:13
Holger Bast, 03/21/2007 00:22 -- Created document.
Holger Bast, 03/21/2007 00:22 -- Created document.