Improved Approximation for the Directed Spanner Problem Grigory Yaroslavtsev Penn State + AT&T Labs - Research (intern) Joint work with Berman (PSU), Bhattacharyya.

Slides:



Advertisements
Similar presentations
1 Copyright © 2013 Elsevier Inc. All rights reserved. Chapter 116.
Advertisements

1 Copyright © 2013 Elsevier Inc. All rights reserved. Chapter 107.
1 Copyright © 2013 Elsevier Inc. All rights reserved. Chapter 40.
1 Copyright © 2013 Elsevier Inc. All rights reserved. Chapter 28.
1 Copyright © 2013 Elsevier Inc. All rights reserved. Chapter 44.
1 Copyright © 2013 Elsevier Inc. All rights reserved. Chapter 101.
1 Copyright © 2013 Elsevier Inc. All rights reserved. Chapter 38.
1 Copyright © 2013 Elsevier Inc. All rights reserved. Chapter 58.
1 Copyright © 2013 Elsevier Inc. All rights reserved. Chapter 112.
1 Copyright © 2013 Elsevier Inc. All rights reserved. Chapter 75.
Chapter 1 Image Slides Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Iterative Rounding and Iterative Relaxation
The Primal-Dual Method: Steiner Forest TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AA A A AA A A A AA A A.
1 Transitive-Closure Spanners Sofya Raskhodnikova Penn State University Joint work with Arnab Bhattacharyya MIT Elena Grigorescu MIT Kyomin Jung MIT David.
Routing in Undirected Graphs with Constant Congestion Julia Chuzhoy Toyota Technological Institute at Chicago.
High-Performance Computing Seminar © Toni Cortes A Case for Heterogeneous Disk Arrays Toni Cortes.
Random Quantum Circuits are Unitary Polynomial-Designs Fernando G.S.L. Brandão 1 Aram Harrow 2 Michal Horodecki 3 1.Universidade Federal de Minas Gerais,
Primal Dual Combinatorial Algorithms Qihui Zhu May 11, 2009.
Lower Bounds for Testing Properties of Functions on Hypergrids Grigory Yaroslavtsev Joint with: Eric Blais (MIT) Sofya Raskhodnikova.
Grigory Yaroslavtsev Joint work with Piotr Berman and Sofya Raskhodnikova.
Planning for Fast Connectivity Updates Mihai Pă traşcu Mikkel Thorup …until June 2008 Jobs, anyone?
Prize-collecting Frameworks Mohammad T. HajiAghayi University of Maryland, College Park & AT&T Labs-- Research TexPoint fonts used in EMF. Read the TexPoint.
Online Node-weighted Steiner Connectivity Problems Vahid Liaghat University of Maryland MohammadTaghi Hajiaghayi (UMD) Debmalya Panigrahi (Duke) 1.
Big Data Reading Group Grigory Yaroslavtsev 361 Levine
all-pairs shortest paths in undirected graphs
Approximate Distance Oracles and Spanners with sublinear surplus Mikkel Thorup AT&T Research Uri Zwick Tel Aviv University.
Competitive fault tolerant Distance Oracles and Routing Schemes Weizmann Open U Weizmann Bar Ilan Shiri Chechik Michael Langberg David Peleg Liam Roditty.
Dynamic Graph Algorithms - I
Steiner Transitive-Closure Spanners of Low-Dimensional Posets Grigory Yaroslavtsev Pennsylvania State University + AT&T Labs – Research (intern) Joint.
A Constant Factor Approximation Algorithm for the Multicommodity Rent-or-Buy Problem Amit Kumar Anupam Gupta Tim Roughgarden Bell Labs CMU Cornell joint.
1 On Dynamic Shortest Paths Problems Liam Roditty Uri Zwick Tel Aviv University ESA 2004.
Geometric Spanners for Routing in Mobile Networks Jie Gao, Leonidas Guibas, John Hershberger, Li Zhang, An Zhu.
A general approximation technique for constrained forest problems Michael X. Goemans & David P. Williamson Presented by: Yonatan Elhanani & Yuval Cohen.
Robust Network Design with Exponential Scenarios By: Rohit Khandekar Guy Kortsarz Vahab Mirrokni Mohammad Salavatipour.
1 Approximate Distance Oracles Mikkel Thorup AT&T Research Uri Zwick Tel Aviv University.
Compact Routing Schemes Mikkel Thorup Uri Zwick AT&T Labs – Research Tel Aviv University.
Approximate Distance Oracles for Geometric Spanner Networks Joachim Gudmundsson TUE, Netherlands Christos Levcopoulos Lund U., Sweden Giri Narasimhan Florida.
Distance Approximating Trees in Graphs
Improved Randomized Algorithms for Path Problems in Graphs PhD Thesis Surender Baswana Department of Computer Science & Engineering, I.I.T. Delhi Research.
Distributed Verification and Hardness of Distributed Approximation Atish Das Sarma Stephan Holzer Danupon Nanongkai Gopal Pandurangan David Peleg 1 Weizmann.
V. V. Vazirani. Approximation Algorithms Chapters 3 & 22
1 Finding Sparser Directed Spanners Piotr Berman, Sofya Raskhodnikova, Ge Ruan Pennsylvania State University.
Approximation for Directed Spanner Grigory Yaroslavtsev Penn State + AT&T Labs (intern) Based on a paper at ICALP’11, joint with Berman (PSU), Bhattacharyya.
Transitive-Closure Spanner of Directed Graphs Kyomin Jung KAIST 2009 Combinatorics Workshop Joint work with Arnab Bhattacharyya MIT Elena Grigorescu MIT.
Near Optimal Streaming algorithms for Graph Spanners Surender Baswana IIT Kanpur.
Distance sensitivity oracles in weighted directed graphs Raphael Yuster University of Haifa Joint work with Oren Weimann Weizmann inst.
Stochastic Multicast with Network Coding Ajay Gopinathan, Zongpeng Li Department of Computer Science University of Calgary ICDCS 2009, June , Montreal.
Spanning and Sparsifying Rajmohan Rajaraman Northeastern University, Boston May 2012 Chennai Network Optimization WorkshopSpanning and Sparsifying1.
Approximate Distance Oracles Mikkel Thorup and Uri Zwick Presented By Shiri Chechik.
Fault Tolerant Graph Structures Merav Parter ADGA 2015.
Another story on Multi-commodity Flows and its “dual” Network Monitoring Rohit Khandekar IBM Watson Joint work with Baruch Awerbuch JHU TexPoint fonts.
University “Ss. Cyril and Methodus” SKOPJE Cluster-based MDS Algorithm for Nodes Localization in Wireless Sensor Networks Ass. Biljana Stojkoska.
Shortest Paths in Decremental, Distributed and Streaming Settings 1 Danupon Nanongkai KTH Royal Institute of Technology BIRS, Banff, March 2015.
Complexity and Efficient Algorithms Group / Department of Computer Science Testing the Cluster Structure of Graphs Christian Sohler joint work with Artur.
A randomized linear time algorithm for graph spanners Surender Baswana Postdoctoral Researcher Max Planck Institute for Computer Science Saarbruecken,
Spanning Tree Definition:A tree T is a spanning tree of a graph G if T is a subgraph of G that contains all of the vertices of G. A graph may have more.
ETH Zurich – Distributed Computing Group Stephan HolzerSODA Stephan Holzer Silvio Frischknecht Roger Wattenhofer Networks Cannot Compute Their Diameter.
A Place-based Model for the Internet Topology Xiaotao Cai Victor T.-S. Shi William Perrizo NDSU {Xiaotao.cai, Victor.shi,
Forbidden-Set Distance Labels for Graphs of Bounded Doubling Dimension
Efficient methods for finding low-stretch spanning trees
Improved Randomized Algorithms for Path Problems in Graphs
A survey on approximating graph spanners Guy Kortsarz, Rutgers Camden
Spanners and emulators with sublinear distance errors
CIS 700: “algorithms for Big Data”
Randomized Algorithms CS648
Near-Optimal (Euclidean) Metric Compression
CSCI B609: “Foundations of Data Science”
Approximate Distance Oracles
Compact routing schemes with improved stretch
Distance-preserving Subgraphs of Interval Graphs
Presentation transcript:

Improved Approximation for the Directed Spanner Problem Grigory Yaroslavtsev Penn State + AT&T Labs - Research (intern) Joint work with Berman (PSU), Bhattacharyya (MIT), Makarychev (IBM), Raskhodnikova (PSU)

Directed Spanner Problem

Directed Spanners and Their Friends

Applications of spanners First application: simulating synchronized protocols in unsynchronized networks [Peleg, Ullman ’89] Efficient routing [PU’89, Cowen ’01, Thorup, Zwick ’01, Roditty, Thorup, Zwick ’02, Cowen, Wagner ’04] Parallel/Distributed/Streaming approximation algorithms for shortest paths [Cohen ’98, Cohen ’00, Elkin’01, Feigenbaum, Kannan, McGregor, Suri, Zhang ’08] Algorithms for approximate distance oracles [Thorup, Zwick ’01, Baswana, Sen ’06]

Applications of directed spanners Access control hierarchies Previous work: [Atallah, Frikken, Blanton, CCCS ‘05; De Santis, Ferrara, Masucci, MFCS’07] Solution: [Bhattacharyya, Grigorescu, Jung, Raskhodnikova, Woodruff, SODA’09] Steiner spanners for access control: [Berman, Bhattacharyya, Grigorescu, Raskhodnikova, Woodruff, Y’ ICALP’11 (more on Friday)] Property testing and property reconstruction [BGJRW’09; Raskhodnikova ’10 (survey)]

Plan Undirected vs Directed Previous work Framework = Sampling + LP Sampling LP + Randomized rounding – Directed Spanner – Unit-length 3-spanner – Directed Steiner Forest

Undirected vs Directed

Unit-Length Directed k-Spanner O(n)-approximation: trivial (whole graph)

Overview of the algorithm Paths of stretch k for all edges => paths of stretch k for all pairs of vertices Classify edges: thick and thin Take union of spanners for them – Thick edges: Sampling – Thin edges: LP + randomized rounding Choose thickness parameter to balance approximation

Local Graph

Sampling [BGJRW’09, FKN09, DK11]

Key Idea: Antispanners Antispanner – subset of edges, which destroys all paths from a to b of stretch at most k. Spanner hit all antispanners Enough to hit all minimal antispanners for all thin edges Minimal antispanners can be found efficiently

Linear Program (dual to [DK’11])

Oracle We use a randomized oracle => in both cases oracle can fail with some probability.

Randomized Oracle = Rounding

Unit-length 3-spanner

Conclusion

Thank you! Slides: