Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Thursday, July 07, 2005, 12:15 pm
Duration: This information is not available in the database
Location: This information is not available in the database
Speaker: Yoshio Okamoto (Toyohashi University of Technology)
I will explain a recent paper of Timothy Chan. He gave a new algorithm for the all-pairs shortest paths problem running in O(n3/log n) time. This is the fastest known algorithm for this problem, and quite simple.
Reference: T.M. Chan, All-pairs shortest paths with real weights in O(n3/log n) time. Proc. 9th WADS, 2005, to appear.
Automatic MiSe System Software Version 1.4803M | admin login