Approximation for Directed Spanner Grigory

alexa-scheidler
Published  · 12 slides · 0 views
↓ Download
Approximation for Directed Spanner Grigory
1 / 1
Approximation for Directed Spanner Grigory - slide 1 of 12 Approximation for Directed Spanner Grigory - slide 2 of 12 Approximation for Directed Spanner Grigory - slide 3 of 12 Approximation for Directed Spanner Grigory - slide 4 of 12 Approximation for Directed Spanner Grigory - slide 5 of 12 Approximation for Directed Spanner Grigory - slide 6 of 12 Approximation for Directed Spanner Grigory - slide 7 of 12 Approximation for Directed Spanner Grigory - slide 8 of 12 Approximation for Directed Spanner Grigory - slide 9 of 12 Approximation for Directed Spanner Grigory - slide 10 of 12 Approximation for Directed Spanner Grigory - slide 11 of 12 Approximation for Directed Spanner Grigory - slide 12 of 12
Description
Approximation for Directed Spanner Grigory Yaroslavtsev Penn State ATT Labs (intern) Based on a paper at ICALP11, joint with Berman (PSU), Bhattacharyya (MIT), Makarychev (IBM), Raskhodnikova (PSU) Directed Spanner Problem K-Spanner -

Related Topics

Download this presentation From Below

"Approximation for Directed Spanner Grigory" is the property of its rightful owner. Permission is granted to download and print the materials on this website for personal, non-commercial use only, and to display it on your personal computer provided you do not modify the materials and that you retain all copyright notices contained in the materials. By downloading content from our website, you accept the terms of this agreement.

Presentation Transcript

01
Approximation for Directed Spanner Grigory Yaroslavtsev
Penn State + AT&T Labs (intern)

Based on a paper at ICALP’11, joint with Berman (PSU), Bhattacharyya (MIT), Makarychev (IBM), Raskhodnikova (PSU)<br>
02
Directed Spanner Problem K-Spanner - subset of edges, preserving distances up to a factor k > 1 (stretch k).
Problem: Find the sparsest k-spanner of a directed graph.<br>
03
Why Spanners? Applications
Efficient routing
Simulating synchronized protocols in unsynchronized networks
Parallel/Distributed/Streaming approximation algorithms for shortest paths
Algorithms for distance oracles<br>