Randomized Algorithms CS 648 Lecture 18 • Approximate Distance Oracles • Algorithm for Min-cut : part 1 1
APPROXIMATE DISTANCE ORACLES 2
All-Pairs Shortest Paths • 3
All-Pairs Shortest Paths • 4
All-Pairs Approximate Shortest Paths • 5
A truly magical result Approximate Distance Oracles Space Query time Preprocessing time Mikkel Thorup and Uri Zwick: Approximate Distance Oracles for graphs, Journal of ACM (4), 2005 6
INSPIRATION FROM OUR DAILY LIFE 7
Air/Road Network 8
The Idea • 9
Formal notion of locality 10
Formal notion of locality • 11
12
What is the stretch ? ? ? 13
3 -approximate distance oracle • Global distance info. Local distance info. 14
The real challenge left • 15
The real challenge left 16
Conquering the challenge • 17
Expected space of 3 -approximate distance oracle • 19
5 -APPROXIMATE DISTANCE ORACLE Meant for only those (hopefully nonzero no. of) students whose aim is more than just a good grade in this course. 21