Campus Event Calendar
Event Entry
What and Who
Faster Algorithms for Approximate Distance Oracles and All-Pairs Small Stretch Paths
Kavitha Telikepalli
Max-Planck-Institut für Informatik - D 1
AG1 Mittagsseminar (own work)
AG 1, AG 2, AG 3, AG 4, AG 5, SWS
AG Audience
-- Not specified --
Note: We use this to send email in the morning.
Date, Time and Location
Tuesday, 25 July 2006
13:30
-- Not specified --
E1 4
024
Saarbrücken
Abstract
The most efficient algorithms known for computing small stretch
distances efficiently in weighted graphs are the approximate distance
oracles (Thorup and Zwick, 2001) and all-pairs stretch t
distances for t = 2,7/3, and 3 (Cohen and Zwick, 1998). We present faster
algorithms for these problems.
Joint work with Surender Baswana.
Contact
Khaled Elbassioni
--email hidden
passcode not visible
logged in users only
Khaled Elbassioni, 07/19/2006 14:14 -- Created document.