a light metric spanner lee-ad gottlieb. graph spanners a spanner for graph g is a subgraph h ◦ h...
TRANSCRIPT
![Page 1: A light metric spanner Lee-Ad Gottlieb. Graph spanners A spanner for graph G is a subgraph H ◦ H contains vertices, subset of edges of G Some qualities](https://reader035.vdocuments.net/reader035/viewer/2022062315/5697c0281a28abf838cd6e9c/html5/thumbnails/1.jpg)
A light metric spanner
Lee-Ad Gottlieb
![Page 2: A light metric spanner Lee-Ad Gottlieb. Graph spanners A spanner for graph G is a subgraph H ◦ H contains vertices, subset of edges of G Some qualities](https://reader035.vdocuments.net/reader035/viewer/2022062315/5697c0281a28abf838cd6e9c/html5/thumbnails/2.jpg)
Graph spanners A spanner for graph G is a subgraph
H◦ H contains vertices, subset of edges of
G Some qualities of a spanner
◦ Degree, diameter, stretch, weight◦ Applications: networks, routing, TSP…
G
2
11
H
2
11
11 1
![Page 3: A light metric spanner Lee-Ad Gottlieb. Graph spanners A spanner for graph G is a subgraph H ◦ H contains vertices, subset of edges of G Some qualities](https://reader035.vdocuments.net/reader035/viewer/2022062315/5697c0281a28abf838cd6e9c/html5/thumbnails/3.jpg)
Euclidean spanners
Seminal work in 90’s: Euclidean, planar Das et al. [SoCG ‘93][SODA ‘95], Arya et al. [FOCS ’94]
[STOC ’95], Soares [DCG ‘94], etc.
Remarkable result of Das et al.: ◦ d-dimensional Euclidean spanner◦ Stretch: (1+є) ◦ Weight: WE w(MST)
WE = є–O(d)
◦ Application: faster PTAS for Euclidean TSP Rao-Smith [STOC ‘98] improving Arora [JACM ‘98]
2
11
1
![Page 4: A light metric spanner Lee-Ad Gottlieb. Graph spanners A spanner for graph G is a subgraph H ◦ H contains vertices, subset of edges of G Some qualities](https://reader035.vdocuments.net/reader035/viewer/2022062315/5697c0281a28abf838cd6e9c/html5/thumbnails/4.jpg)
Metric spanners
Recent focus: Spanners in general metric spaces◦ Problem: Metric spaces can be complex◦ Include high-dimensional Euclidean space
Solution: use doubling dimension to characterize complexity of the space◦ Doubling constant : Every ball can be covered by balls
of half the radius.◦ ddim= log
Analogue to Euclidean:◦ ddim = O(d)
1
2
3
4
6
5
7
8
![Page 5: A light metric spanner Lee-Ad Gottlieb. Graph spanners A spanner for graph G is a subgraph H ◦ H contains vertices, subset of edges of G Some qualities](https://reader035.vdocuments.net/reader035/viewer/2022062315/5697c0281a28abf838cd6e9c/html5/thumbnails/5.jpg)
Metric spanners
Recent focus: doubling metric spaces◦ Gao et al. [CGTA ‘06]: low-stretch metric spanners◦ Related to WSPD [Callahan-Kosaraju STOC ‘92]◦ Spawned a line of work
Low degree, hop-diameter, efficient construction… Gottlieb-Roditty [SODA‘08][ESA‘08], Smid [EA‘09], Chan et
al. [SICOMP‘15], Solomon [SODA‘11][STOC‘14], etc.
Upshot:◦ Many results for Euclidean space carry over to
doubling spaces, ◦ Dependence on Euclidean d replaced with ddim.
![Page 6: A light metric spanner Lee-Ad Gottlieb. Graph spanners A spanner for graph G is a subgraph H ◦ H contains vertices, subset of edges of G Some qualities](https://reader035.vdocuments.net/reader035/viewer/2022062315/5697c0281a28abf838cd6e9c/html5/thumbnails/6.jpg)
Light metric spanners Central open question: Low weight???
Do metrics admit (1+є)-stretch spanners of weight: WDw(MST)
◦ for WD independent of n?
◦ for WD = є-O(ddim)?
Best known bounds: WD = O(log n)◦ Smid [EA ‘09], Elkin-Solomon [STOC ‘13]
Euclidean proof doesn’t carry over◦ Very Euclidean-oriented ◦ Uses “leapfrog” property, dumbbell trees
![Page 7: A light metric spanner Lee-Ad Gottlieb. Graph spanners A spanner for graph G is a subgraph H ◦ H contains vertices, subset of edges of G Some qualities](https://reader035.vdocuments.net/reader035/viewer/2022062315/5697c0281a28abf838cd6e9c/html5/thumbnails/7.jpg)
Light metric spanners Central open question: Low weight???
Do metrics admit (1+є)-stretch spanners of weight: WDw(MST)
◦ for WD independent of n?
◦ for WD = є-O(ddim)?
Best known bounds: WD = O(log n)◦ Smid [EA ‘09], Elkin-Solomon [STOC ‘13]
Euclidean proof doesn’t carry over◦ Very Euclidean-oriented ◦ Uses “leapfrog” property, dumbbell trees
This paper: Yes!WD = (ddim/є)O(ddim)
![Page 8: A light metric spanner Lee-Ad Gottlieb. Graph spanners A spanner for graph G is a subgraph H ◦ H contains vertices, subset of edges of G Some qualities](https://reader035.vdocuments.net/reader035/viewer/2022062315/5697c0281a28abf838cd6e9c/html5/thumbnails/8.jpg)
Outline
Review spanner construction via hierarchies Gao et al. [CGTA ‘06]
Reduce doubling spaces to spaces with sparse spanning trees
Build light spanner for sparse spaces
![Page 9: A light metric spanner Lee-Ad Gottlieb. Graph spanners A spanner for graph G is a subgraph H ◦ H contains vertices, subset of edges of G Some qualities](https://reader035.vdocuments.net/reader035/viewer/2022062315/5697c0281a28abf838cd6e9c/html5/thumbnails/9.jpg)
Spanners via hierarchies1-net2-net4-net8-net
![Page 10: A light metric spanner Lee-Ad Gottlieb. Graph spanners A spanner for graph G is a subgraph H ◦ H contains vertices, subset of edges of G Some qualities](https://reader035.vdocuments.net/reader035/viewer/2022062315/5697c0281a28abf838cd6e9c/html5/thumbnails/10.jpg)
Spanners via hierarchies1-net2-net4-net8-net
Radius = 1
Covering: all points are covered
Packing
![Page 11: A light metric spanner Lee-Ad Gottlieb. Graph spanners A spanner for graph G is a subgraph H ◦ H contains vertices, subset of edges of G Some qualities](https://reader035.vdocuments.net/reader035/viewer/2022062315/5697c0281a28abf838cd6e9c/html5/thumbnails/11.jpg)
Spanners via hierarchies1-net2-net4-net8-net
Radius = 2
![Page 12: A light metric spanner Lee-Ad Gottlieb. Graph spanners A spanner for graph G is a subgraph H ◦ H contains vertices, subset of edges of G Some qualities](https://reader035.vdocuments.net/reader035/viewer/2022062315/5697c0281a28abf838cd6e9c/html5/thumbnails/12.jpg)
Spanners via hierarchies1-net2-net4-net8-net
![Page 13: A light metric spanner Lee-Ad Gottlieb. Graph spanners A spanner for graph G is a subgraph H ◦ H contains vertices, subset of edges of G Some qualities](https://reader035.vdocuments.net/reader035/viewer/2022062315/5697c0281a28abf838cd6e9c/html5/thumbnails/13.jpg)
Spanners via hierarchies1-net2-net4-net8-net
![Page 14: A light metric spanner Lee-Ad Gottlieb. Graph spanners A spanner for graph G is a subgraph H ◦ H contains vertices, subset of edges of G Some qualities](https://reader035.vdocuments.net/reader035/viewer/2022062315/5697c0281a28abf838cd6e9c/html5/thumbnails/14.jpg)
Spanners via hierarchies1-net2-net4-net8-net
![Page 15: A light metric spanner Lee-Ad Gottlieb. Graph spanners A spanner for graph G is a subgraph H ◦ H contains vertices, subset of edges of G Some qualities](https://reader035.vdocuments.net/reader035/viewer/2022062315/5697c0281a28abf838cd6e9c/html5/thumbnails/15.jpg)
Spanners via hierarchies1-net2-net4-net8-net
![Page 16: A light metric spanner Lee-Ad Gottlieb. Graph spanners A spanner for graph G is a subgraph H ◦ H contains vertices, subset of edges of G Some qualities](https://reader035.vdocuments.net/reader035/viewer/2022062315/5697c0281a28abf838cd6e9c/html5/thumbnails/16.jpg)
Spanners via hierarchies1-net2-net4-net8-net
![Page 17: A light metric spanner Lee-Ad Gottlieb. Graph spanners A spanner for graph G is a subgraph H ◦ H contains vertices, subset of edges of G Some qualities](https://reader035.vdocuments.net/reader035/viewer/2022062315/5697c0281a28abf838cd6e9c/html5/thumbnails/17.jpg)
Spanners via hierarchies1-net2-net4-net8-net
![Page 18: A light metric spanner Lee-Ad Gottlieb. Graph spanners A spanner for graph G is a subgraph H ◦ H contains vertices, subset of edges of G Some qualities](https://reader035.vdocuments.net/reader035/viewer/2022062315/5697c0281a28abf838cd6e9c/html5/thumbnails/18.jpg)
Hierarchy: levels of 2i-nets
A simpler view
1-net2-net4-net8-net
![Page 19: A light metric spanner Lee-Ad Gottlieb. Graph spanners A spanner for graph G is a subgraph H ◦ H contains vertices, subset of edges of G Some qualities](https://reader035.vdocuments.net/reader035/viewer/2022062315/5697c0281a28abf838cd6e9c/html5/thumbnails/19.jpg)
Add parent-child edges
Spanner construction
Tree
Parent-childedge
![Page 20: A light metric spanner Lee-Ad Gottlieb. Graph spanners A spanner for graph G is a subgraph H ◦ H contains vertices, subset of edges of G Some qualities](https://reader035.vdocuments.net/reader035/viewer/2022062315/5697c0281a28abf838cd6e9c/html5/thumbnails/20.jpg)
Add lateral edges◦Between 2i-net points within distance
2i/є
Spanner construction
Graph
Lateraledge
![Page 21: A light metric spanner Lee-Ad Gottlieb. Graph spanners A spanner for graph G is a subgraph H ◦ H contains vertices, subset of edges of G Some qualities](https://reader035.vdocuments.net/reader035/viewer/2022062315/5697c0281a28abf838cd6e9c/html5/thumbnails/21.jpg)
Spanner Paths
Graph
Path
![Page 22: A light metric spanner Lee-Ad Gottlieb. Graph spanners A spanner for graph G is a subgraph H ◦ H contains vertices, subset of edges of G Some qualities](https://reader035.vdocuments.net/reader035/viewer/2022062315/5697c0281a28abf838cd6e9c/html5/thumbnails/22.jpg)
:Analysis
Path
2i/є
2i/2 2i/2
2i 2i
![Page 23: A light metric spanner Lee-Ad Gottlieb. Graph spanners A spanner for graph G is a subgraph H ◦ H contains vertices, subset of edges of G Some qualities](https://reader035.vdocuments.net/reader035/viewer/2022062315/5697c0281a28abf838cd6e9c/html5/thumbnails/23.jpg)
Application: paths spannerTheorem:
◦Pair of paths with no stretch (or low stretch) admits a (1+є)-stretch light spanner
![Page 24: A light metric spanner Lee-Ad Gottlieb. Graph spanners A spanner for graph G is a subgraph H ◦ H contains vertices, subset of edges of G Some qualities](https://reader035.vdocuments.net/reader035/viewer/2022062315/5697c0281a28abf838cd6e9c/html5/thumbnails/24.jpg)
Application: paths spannerProof construction: greedy
◦Create hierarchy for each path◦Add lateral edges in order of length
iff stretch on current graph > (1+є)
![Page 25: A light metric spanner Lee-Ad Gottlieb. Graph spanners A spanner for graph G is a subgraph H ◦ H contains vertices, subset of edges of G Some qualities](https://reader035.vdocuments.net/reader035/viewer/2022062315/5697c0281a28abf838cd6e9c/html5/thumbnails/25.jpg)
Application: paths spannerProof construction: greedy
◦Create hierarchy for each path◦Add lateral edges in order of length
iff stretch on current graph > (1+є)◦Claim I: low-stretch (immediate)
![Page 26: A light metric spanner Lee-Ad Gottlieb. Graph spanners A spanner for graph G is a subgraph H ◦ H contains vertices, subset of edges of G Some qualities](https://reader035.vdocuments.net/reader035/viewer/2022062315/5697c0281a28abf838cd6e9c/html5/thumbnails/26.jpg)
Application: paths spannerProof construction: greedy
◦Create hierarchy for each path◦Add lateral edges in order of length
iff stretch on current graph > (1+є)◦Claim I: low-stretch◦Claim II: light (charging argument)
![Page 27: A light metric spanner Lee-Ad Gottlieb. Graph spanners A spanner for graph G is a subgraph H ◦ H contains vertices, subset of edges of G Some qualities](https://reader035.vdocuments.net/reader035/viewer/2022062315/5697c0281a28abf838cd6e9c/html5/thumbnails/27.jpg)
Outline
Review spanner construction via hierarchies Gao et al. [CGTA ‘06]
Reduce doubling spaces to spaces with sparse spanning trees
Build light spanner for sparse spaces
![Page 28: A light metric spanner Lee-Ad Gottlieb. Graph spanners A spanner for graph G is a subgraph H ◦ H contains vertices, subset of edges of G Some qualities](https://reader035.vdocuments.net/reader035/viewer/2022062315/5697c0281a28abf838cd6e9c/html5/thumbnails/28.jpg)
SparsityA spanning tree is s-sparse
◦If every ball of radius r>0◦Has edges of total weight sr. r
![Page 29: A light metric spanner Lee-Ad Gottlieb. Graph spanners A spanner for graph G is a subgraph H ◦ H contains vertices, subset of edges of G Some qualities](https://reader035.vdocuments.net/reader035/viewer/2022062315/5697c0281a28abf838cd6e9c/html5/thumbnails/29.jpg)
SparsityA spanning tree is s-sparse
◦If every ball of radius r>0◦Has edges of total weight sr.
Reduce doubling to sparse MST:
r
![Page 30: A light metric spanner Lee-Ad Gottlieb. Graph spanners A spanner for graph G is a subgraph H ◦ H contains vertices, subset of edges of G Some qualities](https://reader035.vdocuments.net/reader035/viewer/2022062315/5697c0281a28abf838cd6e9c/html5/thumbnails/30.jpg)
SparsityA spanning tree is s-sparse
◦If every ball of radius r>0◦Has edges of total weight sr.
Reduce doubling to sparse MST:◦Find dense area
r
![Page 31: A light metric spanner Lee-Ad Gottlieb. Graph spanners A spanner for graph G is a subgraph H ◦ H contains vertices, subset of edges of G Some qualities](https://reader035.vdocuments.net/reader035/viewer/2022062315/5697c0281a28abf838cd6e9c/html5/thumbnails/31.jpg)
SparsityA spanning tree is s-sparse
◦If every ball of radius r>0◦Has edges of total weight sr.
Reduce doubling to sparse MST:◦Remove
r
![Page 32: A light metric spanner Lee-Ad Gottlieb. Graph spanners A spanner for graph G is a subgraph H ◦ H contains vertices, subset of edges of G Some qualities](https://reader035.vdocuments.net/reader035/viewer/2022062315/5697c0281a28abf838cd6e9c/html5/thumbnails/32.jpg)
SparsityA spanning tree is s-sparse
◦If every ball of radius r>0◦Has edges of total weight sr.
Reduce doubling to sparse MST:◦Repeat
r
![Page 33: A light metric spanner Lee-Ad Gottlieb. Graph spanners A spanner for graph G is a subgraph H ◦ H contains vertices, subset of edges of G Some qualities](https://reader035.vdocuments.net/reader035/viewer/2022062315/5697c0281a28abf838cd6e9c/html5/thumbnails/33.jpg)
SparsityA spanning tree is s-sparse
◦If every ball of radius r>0◦Has edges of total weight sr.
Reduce doubling to sparse MST:◦Sparsity s = (ddim/є)O(ddim)
r
![Page 34: A light metric spanner Lee-Ad Gottlieb. Graph spanners A spanner for graph G is a subgraph H ◦ H contains vertices, subset of edges of G Some qualities](https://reader035.vdocuments.net/reader035/viewer/2022062315/5697c0281a28abf838cd6e9c/html5/thumbnails/34.jpg)
Outline
Review spanner construction via hierarchies Gao et al. [CGTA ‘06]
Reduce doubling spaces to spaces with sparse spanning trees
Build light spanner for sparse spaces
![Page 35: A light metric spanner Lee-Ad Gottlieb. Graph spanners A spanner for graph G is a subgraph H ◦ H contains vertices, subset of edges of G Some qualities](https://reader035.vdocuments.net/reader035/viewer/2022062315/5697c0281a28abf838cd6e9c/html5/thumbnails/35.jpg)
Spanner for sparse treesBasic idea:
◦Pairs of low-stretch paths admit light spanner◦Decompose tree into many low-stretch paths◦Build light spanner for every close pair
Tree sparsity guarantees only a small number of close pairs
Tree decomposition:◦Step 1: Decompose tree into arbitrary paths◦Step 2: Replace paths with low-stretch paths
![Page 36: A light metric spanner Lee-Ad Gottlieb. Graph spanners A spanner for graph G is a subgraph H ◦ H contains vertices, subset of edges of G Some qualities](https://reader035.vdocuments.net/reader035/viewer/2022062315/5697c0281a28abf838cd6e9c/html5/thumbnails/36.jpg)
Step 1: Tree decompositionGiven a spanning tree, remove
edges of longest path and repeat
![Page 37: A light metric spanner Lee-Ad Gottlieb. Graph spanners A spanner for graph G is a subgraph H ◦ H contains vertices, subset of edges of G Some qualities](https://reader035.vdocuments.net/reader035/viewer/2022062315/5697c0281a28abf838cd6e9c/html5/thumbnails/37.jpg)
Step 2: Path replacementReplace path with low-stretch
paths ◦Small weight increase – geometric
series
![Page 38: A light metric spanner Lee-Ad Gottlieb. Graph spanners A spanner for graph G is a subgraph H ◦ H contains vertices, subset of edges of G Some qualities](https://reader035.vdocuments.net/reader035/viewer/2022062315/5697c0281a28abf838cd6e9c/html5/thumbnails/38.jpg)
AltogetherGiven a graph
◦ Decompose into sparse trees◦ Decompose sparse tree into paths◦ Replace paths with low-stretch paths◦ Build path spanners
![Page 39: A light metric spanner Lee-Ad Gottlieb. Graph spanners A spanner for graph G is a subgraph H ◦ H contains vertices, subset of edges of G Some qualities](https://reader035.vdocuments.net/reader035/viewer/2022062315/5697c0281a28abf838cd6e9c/html5/thumbnails/39.jpg)
Outline
Review spanner construction via hierarchies Gao et al. [CGTA ‘06]
Reduce doubling spaces to spaces with sparse spanning trees admit
Build light spanner for sparse spaces