Distributed Approximate Single-Source Shortest Paths
|
|
- Violet Cox
- 5 years ago
- Views:
Transcription
1 Distributed Approximate Single-Source Shortest Paths Sebastian Krinninger University of Vienna joint works with Ruben Monika Andreas Christoph Danupon Becker Henzinger Karrenbauer Lenzen Nanongkai 1 / 26
2 One Problem Two Results Distributed (1 + ε)-approximate single-source shortest paths (SSSP) 2 / 26
3 One Problem Two Results Distributed (1 + ε)-approximate single-source shortest paths (SSSP) 1 Deterministically compute approximate shortest paths in ( n + Diam) n o(1) rounds for ε 1/polylog(n) [Henzinger/K/Nanongkai 16] 2 / 26
4 One Problem Two Results Distributed (1 + ε)-approximate single-source shortest paths (SSSP) 1 Deterministically compute approximate shortest paths in ( n + Diam) n o(1) rounds for ε 1/polylog(n) [Henzinger/K/Nanongkai 16] 2 Deterministically compute approximate shortest paths in ( n + Diam) poly(log n, ε) rounds [Becker/Lenzen/Karrenbauer/K 16] 2 / 26
5 One Problem Two Results Distributed (1 + ε)-approximate single-source shortest paths (SSSP) 1 Deterministically compute approximate shortest paths in ( n + Diam) n o(1) rounds for ε 1/polylog(n) [Henzinger/K/Nanongkai 16] 2 Deterministically compute approximate shortest paths in ( n + Diam) poly(log n, ε) rounds [Becker/Lenzen/Karrenbauer/K 16] Comparison: Lower bound: Ω( n + Diam) rounds [Das Sarma et al 11] Exact SSSP: O((n log n) 2/3 Diam 1/3 ) rounds (randomized) [Elkin 17] 1 + ε: O(n 1/2 Diam 1/4 + Diam) (randomized) [Nanongkai 14] 2 / 26
6 One Problem Two Results Distributed (1 + ε)-approximate single-source shortest paths (SSSP) 1 Deterministically compute approximate shortest paths in ( n + Diam) n o(1) rounds for ε 1/polylog(n) [Henzinger/K/Nanongkai 16] 2 Deterministically compute approximate shortest paths in ( n + Diam) poly(log n, ε) rounds [Becker/Lenzen/Karrenbauer/K 16] Comparison: Lower bound: Ω( n + Diam) rounds [Das Sarma et al 11] Exact SSSP: O((n log n) 2/3 Diam 1/3 ) rounds (randomized) [Elkin 17] 1 + ε: O(n 1/2 Diam 1/4 + Diam) (randomized) [Nanongkai 14] Today: Weighted undirected graphs 2 / 26
7 Tight and Tighter 3 / 26
8 Tight and Tighter Combinatorics & Optimization 3 / 26
9 Model and Problem Statement Many distributed models measure amount of communication Running time = number of rounds 4 / 26
10 Model and Problem Statement Many distributed models measure amount of communication Running time = number of rounds CONGEST model: Synchronous rounds (global clock) Message size O(log n) In each round, every node sends (at most) one message to each neighbor Local computation is free 4 / 26
11 Model and Problem Statement Many distributed models measure amount of communication Running time = number of rounds CONGEST model: Synchronous rounds (global clock) Message size O(log n) In each round, every node sends (at most) one message to each neighbor Local computation is free Problem statement: Initially, each node knows whether it is the source or not Finally: Every node knows its approximate distance to the source Often also: Implicit tree; every node knows next edge on approximate shortest path to source 4 / 26
12 Unweighted Graphs: BFS s 5 / 26
13 Unweighted Graphs: BFS 0 5 / 26
14 Unweighted Graphs: BFS 0 5 / 26
15 Unweighted Graphs: BFS / 26
16 Unweighted Graphs: BFS / 26
17 Unweighted Graphs: BFS / 26
18 Unweighted Graphs: BFS / 26
19 Unweighted Graphs: BFS BFS tree can be computed in O(Diam) rounds 5 / 26
20 Reduce to SSSP on Overlay Network [Nanongkai 14] 6 / 26
21 Reduce to SSSP on Overlay Network [Nanongkai 14] 1 Solve SSSP on overlay network and make global knowledge 2 Combine local knowledge of local neighborhoods with global knowledge 6 / 26
22 Reduce to SSSP on Overlay Network [Nanongkai 14] 1 Solve SSSP on overlay network and make global knowledge 2 Combine local knowledge of local neighborhoods with global knowledge Sample N = Õ(n 1/2 ) centers (+ source s) Every shortest path with n 1/2 edges contains center whp 6 / 26
23 Derandomization of Overlay Network [HKN 16] Randomization: Hit every shortest path with n edges u v 7 / 26
24 Derandomization of Overlay Network [HKN 16] Randomization: Hit every shortest path with n edges u v Deterministic relaxation: Almost hit every path n edges εd(u, v) u v 7 / 26
25 Congested Clique Special model: Communication not restricted to neighbors In each round, each node can send one message to each other node Heavily studied in recent years! 8 / 26
26 Congested Clique Special model: Communication not restricted to neighbors In each round, each node can send one message to each other node Heavily studied in recent years! Simulation: Overlay network as congested clique t rounds in Congested Clique Õ(t ( n + Diam)) rounds in CONGEST 8 / 26
27 Hop Reduction 9 / 26
28 Well Known: Spanners Definition A k-spanner is a subgraph H of G such that, for all pairs of nodes u and v, dist H (u, v) k dist G (u, v). 10 / 26
29 Well Known: Spanners Definition A k-spanner is a subgraph H of G such that, for all pairs of nodes u and v, dist H (u, v) k dist G (u, v). 10 / 26
30 Well Known: Spanners Definition A k-spanner is a subgraph H of G such that, for all pairs of nodes u and v, dist H (u, v) k dist G (u, v). 10 / 26
31 Well Known: Spanners Definition A k-spanner is a subgraph H of G such that, for all pairs of nodes u and v, dist H (u, v) k dist G (u, v). Fact: Every graph has a k-spanner of size n 1+1/k [Folklore] Application: Running time T(m, n) T(n 1+1/k, n) 10 / 26
32 Less Known: Hop Sets Definition An (h, ε)-hop set is a set of weighted edges F such that, for all pairs of nodes u and v, in the shortcut graph G F there is a path from u to v with at most h edges of weight at most (1 + ε)dist(u, v). 11 / 26
33 Less Known: Hop Sets Definition An (h, ε)-hop set is a set of weighted edges F such that, for all pairs of nodes u and v, in the shortcut graph G F there is a path from u to v with at most h edges of weight at most (1 + ε)dist(u, v). 11 / 26
34 Less Known: Hop Sets Definition An (h, ε)-hop set is a set of weighted edges F such that, for all pairs of nodes u and v, in the shortcut graph G F there is a path from u to v with at most h edges of weight at most (1 + ε)dist(u, v). 11 / 26
35 Less Known: Hop Sets Definition An (h, ε)-hop set is a set of weighted edges F such that, for all pairs of nodes u and v, in the shortcut graph G F there is a path from u to v with at most h edges of weight at most (1 + ε)dist(u, v). Fact: Every graph has a (n o(1), ε)-hop set of size n 1+o(1) [Cohen 94] (for ε 1/polylogn) 11 / 26
36 Less Known: Hop Sets Definition An (h, ε)-hop set is a set of weighted edges F such that, for all pairs of nodes u and v, in the shortcut graph G F there is a path from u to v with at most h edges of weight at most (1 + ε)dist(u, v). Application? SSSP up to h hops (Bellman-Ford) RAM: O(mh) time 11 / 26
37 Less Known: Hop Sets Definition An (h, ε)-hop set is a set of weighted edges F such that, for all pairs of nodes u and v, in the shortcut graph G F there is a path from u to v with at most h edges of weight at most (1 + ε)dist(u, v). Application? SSSP up to h hops (Bellman-Ford) RAM: O(mh) time PRAM: O(mh) with O(h) depth 11 / 26
38 Less Known: Hop Sets Definition An (h, ε)-hop set is a set of weighted edges F such that, for all pairs of nodes u and v, in the shortcut graph G F there is a path from u to v with at most h edges of weight at most (1 + ε)dist(u, v). Application? SSSP up to h hops (Bellman-Ford) RAM: O(mh) time PRAM: O(mh) with O(h) depth Congested Clique: O(h) rounds 11 / 26
39 Less Known: Hop Sets Definition An (h, ε)-hop set is a set of weighted edges F such that, for all pairs of nodes u and v, in the shortcut graph G F there is a path from u to v with at most h edges of weight at most (1 + ε)dist(u, v). Application? SSSP up to h hops (Bellman-Ford) RAM: O(mh) time PRAM: O(mh) with O(h) depth Congested Clique: O(h) rounds Streaming: h passes with O(n) space 11 / 26
40 Less Known: Hop Sets Definition An (h, ε)-hop set is a set of weighted edges F such that, for all pairs of nodes u and v, in the shortcut graph G F there is a path from u to v with at most h edges of weight at most (1 + ε)dist(u, v). Application? SSSP up to h hops (Bellman-Ford) RAM: O(mh) time PRAM: O(mh) with O(h) depth Congested Clique: O(h) rounds Streaming: h passes with O(n) space Incremental/Decremental O(mh) [Even/Shiloach 81, HKN 14] 11 / 26
41 Less Known: Hop Sets Definition An (h, ε)-hop set is a set of weighted edges F such that, for all pairs of nodes u and v, in the shortcut graph G F there is a path from u to v with at most h edges of weight at most (1 + ε)dist(u, v). Application? SSSP up to h hops (Bellman-Ford) RAM: O(mh) time PRAM: O(mh) with O(h) depth Congested Clique: O(h) rounds Streaming: h passes with O(n) space Incremental/Decremental O(mh) [Even/Shiloach 81, HKN 14] Hopset with h = n o(1) and size n 1+o(1) gives almost tight algorithms 11 / 26
42 Less Known: Hop Sets Definition An (h, ε)-hop set is a set of weighted edges F such that, for all pairs of nodes u and v, in the shortcut graph G F there is a path from u to v with at most h edges of weight at most (1 + ε)dist(u, v). Application? SSSP up to h hops (Bellman-Ford) RAM: O(mh) time PRAM: O(mh) with O(h) depth Congested Clique: O(h) rounds Streaming: h passes with O(n) space Incremental/Decremental O(mh) [Even/Shiloach 81, HKN 14] Hopset with h = n o(1) and size n 1+o(1) gives almost tight algorithms Remaining challenge: Compute hop set efficiently 11 / 26
43 Hop Sets: Approaching Optimality Authors Stretch α Hopbound h Size [Baseline] 1 1 O(n 2 ) 12 / 26
44 Hop Sets: Approaching Optimality Authors Stretch α Hopbound h Size [Baseline] 1 1 O(n 2 ) [Klein/Subramanian 97] 1 O( n log n t ) O(t 2 ) [Shi/Spencer 99] 1 O( n t ) O(nt) 12 / 26
45 Hop Sets: Approaching Optimality Authors Stretch α Hopbound h Size [Baseline] 1 1 O(n 2 ) [Klein/Subramanian 97] 1 O( n log n t ) O(t 2 ) [Shi/Spencer 99] 1 O( n t ) O(nt) [Thorup/Zwick 01] 2k 1 2 O(kn 1+ 1 k ) 12 / 26
46 Hop Sets: Approaching Optimality Authors Stretch α Hopbound h Size [Baseline] 1 1 O(n 2 ) [Klein/Subramanian 97] 1 O( n log n t ) O(t 2 ) [Shi/Spencer 99] 1 O( n t ) O(nt) [Thorup/Zwick 01] 2k 1 2 O(kn 1+ 1 k ) [Cohen 94] 1 + ε ( log n ε ) O(log k) O(n 1+ 1 k log n) [Bernstein 09] 1 + ε O( 3 ε )k log n O(kn 1+ 1 k ) [Elkin/Neiman 16] 1 + ε ( log k ε ) O(log k) O(n 1+ 1 k log n log k) [Elkin/Neiman 17] 1 + ε O( k+1 ε )k+1 O(n k+1 1 ) [Huang/Pettie 17] 1 + ε O( k ε )k O(n k+1 1 ) 12 / 26
47 Hop Sets: Approaching Optimality Authors Stretch α Hopbound h Size [Baseline] 1 1 O(n 2 ) [Klein/Subramanian 97] 1 O( n log n t ) O(t 2 ) [Shi/Spencer 99] 1 O( n t ) O(nt) [Thorup/Zwick 01] 2k 1 2 O(kn 1+ 1 k ) [Cohen 94] 1 + ε ( log n ε ) O(log k) O(n 1+ 1 k log n) [Bernstein 09] 1 + ε O( 3 ε )k log n O(kn 1+ 1 k ) [Elkin/Neiman 16] 1 + ε ( log k ε ) O(log k) O(n 1+ 1 k log n log k) [Elkin/Neiman 17] 1 + ε O( k+1 ε )k+1 O(n k+1 1 ) [Huang/Pettie 17] 1 + ε O( k ε )k O(n k+1 1 ) [Abboud/Bodwin/Pettie 16] 1 + ε Ω k ( 1 ε )k n k 1 δ 12 / 26
48 Hop Sets: Approaching Optimality Authors Stretch α Hopbound h Size [Baseline] 1 1 O(n 2 ) [Klein/Subramanian 97] 1 O( n log n t ) O(t 2 ) [Shi/Spencer 99] 1 O( n t ) O(nt) [Thorup/Zwick 01] 2k 1 2 O(kn 1+ 1 k ) [Cohen 94] 1 + ε ( log n ε ) O(log k) O(n 1+ 1 k log n) [Bernstein 09] 1 + ε O( 3 ε )k log n O(kn 1+ 1 k ) [Elkin/Neiman 16] 1 + ε ( log k ε ) O(log k) O(n 1+ 1 k log n log k) [Elkin/Neiman 17] 1 + ε O( k+1 ε )k+1 O(n k+1 1 ) [Huang/Pettie 17] 1 + ε O( k ε )k O(n k+1 1 ) [Abboud/Bodwin/Pettie 16] 1 + ε Ω k ( 1 ε )k n k 1 δ Cannot have α = 1 + ε, h = poly(1/ε) and size n polylog(n). 12 / 26
49 It was too good to be true / 26
50 Hop Set Example 14 / 26
51 Simple Hop Set Based on Balls (following [Thorup/Zwick 06]) V = A 0 A 1 A k = where node of A i goes to A i+1 with probability 1/n 1/k v has priority i if v A i \ A i+1 15 / 26
52 Simple Hop Set Based on Balls (following [Thorup/Zwick 06]) V = A 0 A 1 A k = where node of A i goes to A i+1 with probability 1/n 1/k v has priority i if v A i \ A i+1 For every node u of priority i: Ball(u) = {v V dist(u, v) < dist(u, A i+1 )} 15 / 26
53 Simple Hop Set Based on Balls (following [Thorup/Zwick 06]) V = A 0 A 1 A k = where node of A i goes to A i+1 with probability 1/n 1/k v has priority i if v A i \ A i+1 pr. i + 1 For every node u of priority i: Ball(u) = {v V dist(u, v) < dist(u, A i+1 )} pr. i 15 / 26
54 Simple Hop Set Based on Balls (following [Thorup/Zwick 06]) V = A 0 A 1 A k = where node of A i goes to A i+1 with probability 1/n 1/k v has priority i if v A i \ A i+1 pr. i + 1 For every node u of priority i: Ball(u) = {v V dist(u, v) < dist(u, A i+1 )} pr. i 15 / 26
55 Simple Hop Set Based on Balls (following [Thorup/Zwick 06]) V = A 0 A 1 A k = where node of A i goes to A i+1 with probability 1/n 1/k v has priority i if v A i \ A i+1 pr. i + 1 For every node u of priority i: Ball(u) = {v V dist(u, v) < dist(u, A i+1 )} pr. i Hop set: (u, v) F iff v Ball(u) w(u, v) = dist G (u, v) 15 / 26
56 Simple Hop Set Based on Balls (following [Thorup/Zwick 06]) V = A 0 A 1 A k = where node of A i goes to A i+1 with probability 1/n 1/k v has priority i if v A i \ A i+1 pr. i + 1 For every node u of priority i: Ball(u) = {v V dist(u, v) < dist(u, A i+1 )} pr. i priority # nodes 0 n 1 n 1 1/k.. k 1 n 1/k Hop set: (u, v) F iff v Ball(u) w(u, v) = dist G (u, v) 15 / 26
57 Simple Hop Set Based on Balls (following [Thorup/Zwick 06]) V = A 0 A 1 A k = where node of A i goes to A i+1 with probability 1/n 1/k v has priority i if v A i \ A i+1 For every node u of priority i: Ball(u) = {v V dist(u, v) < dist(u, A i+1 )} Expected size: n (i+1)/k priority # nodes Ball(u) 0 n n 1/k 1 n 1 1/k n 2/k... k 1 n 1/k n pr. i + 1 pr. i Hop set: (u, v) F iff v Ball(u) w(u, v) = dist G (u, v) 15 / 26
58 Simple Hop Set Based on Balls (following [Thorup/Zwick 06]) V = A 0 A 1 A k = where node of A i goes to A i+1 with probability 1/n 1/k v has priority i if v A i \ A i+1 For every node u of priority i: Ball(u) = {v V dist(u, v) < dist(u, A i+1 )} Expected size: n (i+1)/k priority # nodes Ball(u) # edges 0 n n 1/k n 1+1/k 1 n 1 1/k n 2/k n 1+1/k.... k 1 n 1/k n n 1+1/k pr. i + 1 pr. i Hop set: (u, v) F iff v Ball(u) w(u, v) = dist G (u, v) 15 / 26
59 Simple Hop Set Based on Balls (following [Thorup/Zwick 06]) V = A 0 A 1 A k = where node of A i goes to A i+1 with probability 1/n 1/k v has priority i if v A i \ A i+1 For every node u of priority i: Ball(u) = {v V dist(u, v) < dist(u, A i+1 )} Expected size: n (i+1)/k priority # nodes Ball(u) # edges 0 n n 1/k n 1+1/k 1 n 1 1/k n 2/k n 1+1/k.... k 1 n 1/k n n 1+1/k kn 1+1/k pr. i + 1 pr. i Hop set: (u, v) F iff v Ball(u) w(u, v) = dist G (u, v) 15 / 26
60 Parameter Choice k = log n log 4/ε ( ) k 4 = n 1/k ε 16 / 26
61 Parameter Choice k = log n log 4/ε ( ) k 4 = n 1/k = n o(1) ε 16 / 26
62 (n 1/2+o(1), ε)-hop set Case 1: dist(u 0, v) n 1/2+1/k /ε u 0 v 17 / 26
63 (n 1/2+o(1), ε)-hop set Case 2: dist(u 0, v) > n 1/2+1/k /ε u 0 v 17 / 26
64 (n 1/2+o(1), ε)-hop set Case 2: dist(u 0, v) > n 1/2+1/k /ε r 0 = n 1/2 u 0 v 0 v r 0 17 / 26
65 (n 1/2+o(1), ε)-hop set Case 2: dist(u 0, v) > n 1/2+1/k /ε r 0 = n 1/2 u 1 r 0 u 0 r 0 v 0 v For every node u of priority i and every node v, either (u, v) H, or u of priority i + 1 s. t. dist(u, u ) dist(u, v). 17 / 26
66 (n 1/2+o(1), ε)-hop set Case 2: dist(u 0, v) > n 1/2+1/k /ε u 2 r 1 r 0 = n 1/2 ( r i+1 = ) ε 0 j i r j r u 1 1 r 0 u 0 r 0 v 0 v 1 v For every node u of priority i and every node v, either (u, v) H, or u of priority i + 1 s. t. dist(u, u ) dist(u, v). 17 / 26
67 (n 1/2+o(1), ε)-hop set Case 2: dist(u 0, v) > n 1/2+1/k /ε u 2 r 1 r 2 r 0 = n 1/2 ( r i+1 = ) ε 0 j i r j r u 1 1 r 0 u 0 r 0 v 0 v 1 v 2 v For every node u of priority i and every node v, either (u, v) H, or u of priority i + 1 s. t. dist(u, u ) dist(u, v). 17 / 26
68 (n 1/2+o(1), ε)-hop set Case 2: dist(u 0, v) > n 1/2+1/k /ε increasing priority u 2 r 1 r 2 r u 1 1 r 0 u 0 r 0 v 0 v 1 v 2 v decreasing distance to v r 0 = n 1/2 ( r i+1 = ) ε 0 j i For every node u of priority i and every node v, either (u, v) H, or u of priority i + 1 s. t. dist(u, u ) dist(u, v). r j 17 / 26
69 (n 1/2+o(1), ε)-hop set Case 2: dist(u 0, v) > n 1/2+1/k /ε increasing priority u 2 r 1 r 2 r u 1 1 r 0 u 0 r 0 v 0 v 1 v 2 v decreasing distance to v r 0 = n 1/2 ( r i+1 = ) ε n 1/2 n 1/k 0 j i r j k = log n/ log 4/ε For every node u of priority i and every node v, either (u, v) H, or u of priority i + 1 s. t. dist(u, u ) dist(u, v). Weight (1 + ε)dist(u 0, v) 17 / 26
70 (n 1/2+o(1), ε)-hop set Case 2: dist(u 0, v) > n 1/2+1/k /ε increasing priority u 2 r 1 r 2 r u 1 1 r 0 u 0 r 0 v 0 v 1 v 2 v decreasing distance to v r 0 = n 1/2 ( r i+1 = ) ε n 1/2 n 1/k 0 j i r j k = log n/ log 4/ε For every node u of priority i and every node v, either (u, v) H, or u of priority i + 1 s. t. dist(u, u ) dist(u, v). Weight (1 + ε)dist(u 0, v) #Edges k dist(u, v) n 1/2 k n = kn1/2 n1/2 17 / 26
71 Chicken-Egg Problem? 1 Goal: Faster SSSP via hop set 2 Compute hop set by computing balls 3 Computing balls at least as hard as SSSP Back at problem we wanted to solve initially? 18 / 26
72 Chicken-Egg Problem? 1 Goal: Faster SSSP via hop set 2 Compute hop set by computing balls 3 Computing balls at least as hard as SSSP Back at problem we wanted to solve initially? No! (n 1/2+o(1), ε)-hop set only requires balls up to n 1/2+o(1) hops 18 / 26
73 (n 1/2+o(1), ε)-hop set Iterative computation In each iteration number of hops is reduced by a factor of n 1/k 19 / 26
74 (n 1/2+o(1), ε)-hop set Iterative computation In each iteration number of hops is reduced by a factor of n 1/k Algorithm: for i = 1 to k do H i = G 1 j i 1 F j Compute balls with k priorities in H i up to n 2/k hops F i = {(u, v) v Ball(u)} end return F = 1 i k F i 19 / 26
75 (n 1/2+o(1), ε)-hop set Iterative computation In each iteration number of hops is reduced by a factor of n 1/k Algorithm: for i = 1 to k do H i = G 1 j i 1 F j Compute balls with k priorities in H i up to n 2/k hops F i = {(u, v) v Ball(u)} end return F = 1 i k F i Error amplification: (1 + ε ) k (1 + ε) for ε = 1/(2ε log n) 19 / 26
76 (n 1/2+o(1), ε)-hop set Iterative computation In each iteration number of hops is reduced by a factor of n 1/k Algorithm: for i = 1 to k do H i = G 1 j i 1 F j Compute balls with k priorities in H i up to n 2/k hops F i = {(u, v) v Ball(u)} end return F = 1 i k F i Error amplification: (1 + ε ) k (1 + ε) for ε = 1/(2ε log n) Omitted detail: weighted graphs, use rounding technique 19 / 26
77 Beyond Hop Sets 20 / 26
78 New Distributed Algorithm Theorem ([Becker/Karrenbauer/K/Lenzen arxiv 16]) There is a deterministic algorithm for computing (1 + ε) approximate SSSP in ( n + Diam)poly(log n, ε) rounds. 21 / 26
79 New Distributed Algorithm Theorem ([Becker/Karrenbauer/K/Lenzen arxiv 16]) There is a deterministic algorithm for computing (1 + ε) approximate SSSP in ( n + Diam)poly(log n, ε) rounds. Key insight: Solve more general problem Shortest Transshipment Problem Find the cheapest route for sending units of a single good from sources to sinks along the edges of a graph as specified by demands on nodes. 21 / 26
80 New Distributed Algorithm Theorem ([Becker/Karrenbauer/K/Lenzen arxiv 16]) There is a deterministic algorithm for computing (1 + ε) approximate SSSP in ( n + Diam)poly(log n, ε) rounds. Key insight: Solve more general problem Shortest Transshipment Problem Find the cheapest route for sending units of a single good from sources to sinks along the edges of a graph as specified by demands on nodes. Uncapacitated minimum-cost flow 21 / 26
81 New Distributed Algorithm Theorem ([Becker/Karrenbauer/K/Lenzen arxiv 16]) There is a deterministic algorithm for computing (1 + ε) approximate SSSP in ( n + Diam)poly(log n, ε) rounds. Key insight: Solve more general problem Shortest Transshipment Problem Find the cheapest route for sending units of a single good from sources to sinks along the edges of a graph as specified by demands on nodes. Uncapacitated minimum-cost flow SSSP: source has demand (n 1), other nodes have demand 1 21 / 26
82 Shortest Transshipment Problem Shortest transshipment as linear program: minimize Wx 1 s.t. Ax = b 22 / 26
83 Shortest Transshipment Problem Shortest transshipment as linear program: minimize Wx 1 s.t. Ax = b Dual program: maximize b T y s.t. W 1 A T y 1 22 / 26
84 Shortest Transshipment Problem Shortest transshipment as linear program: minimize Wx 1 s.t. Ax = b Dual program: maximize b T y s.t. W 1 A T y 1 Equivalent: minimize W 1 A T y s.t. b T π = 1 22 / 26
85 Shortest Transshipment Problem Shortest transshipment as linear program: minimize Wx 1 s.t. Ax = b Dual program: maximize b T y s.t. W 1 A T y 1 Equivalent: minimize W 1 A T y s.t. b T π = 1 We approximate by soft-max: lse β (x) := 1 β ln i [d] ( e βx i + e βx i ) 22 / 26
86 Gradient Descent Algorithm at a glance: 1 Soft-max is differentiable apply gradient descent 23 / 26
87 Gradient Descent Algorithm at a glance: 1 Soft-max is differentiable apply gradient descent 2 Each iteration: solve transshipment problem with different demand vector b depending on current gradient 23 / 26
88 Gradient Descent Algorithm at a glance: 1 Soft-max is differentiable apply gradient descent 2 Each iteration: solve transshipment problem with different demand vector b depending on current gradient 3 Key observation: For b, bad approximation is sufficient 23 / 26
89 Gradient Descent Algorithm at a glance: 1 Soft-max is differentiable apply gradient descent 2 Each iteration: solve transshipment problem with different demand vector b depending on current gradient 3 Key observation: For b, bad approximation is sufficient 4 Compute spanner on overlay network and solving transshipment on overlay spanner Spanner has stretch O(log n) and size Õ(n) 23 / 26
90 Gradient Descent Algorithm at a glance: 1 Soft-max is differentiable apply gradient descent 2 Each iteration: solve transshipment problem with different demand vector b depending on current gradient 3 Key observation: For b, bad approximation is sufficient 4 Compute spanner on overlay network and solving transshipment on overlay spanner Spanner has stretch O(log n) and size Õ(n) 5 Overall: Polylog iterations, each solving O(log n)-approximate transshipment on graph of Õ(n) edges 23 / 26
91 Gradient Descent Algorithm at a glance: 1 Soft-max is differentiable apply gradient descent 2 Each iteration: solve transshipment problem with different demand vector b depending on current gradient Congested Clique: Compute gradient in O(1) rounds 3 Key observation: For b, bad approximation is sufficient 4 Compute spanner on overlay network and solving transshipment on overlay spanner Spanner has stretch O(log n) and size Õ(n) 5 Overall: Polylog iterations, each solving O(log n)-approximate transshipment on graph of Õ(n) edges 23 / 26
92 Gradient Descent Algorithm at a glance: 1 Soft-max is differentiable apply gradient descent 2 Each iteration: solve transshipment problem with different demand vector b depending on current gradient Congested Clique: Compute gradient in O(1) rounds 3 Key observation: For b, bad approximation is sufficient 4 Compute spanner on overlay network and solving transshipment on overlay spanner Spanner has stretch O(log n) and size Õ(n) Congested Clique: Spanner can be computed in O(log n) rounds [Baswana/Sen 03] 5 Overall: Polylog iterations, each solving O(log n)-approximate transshipment on graph of Õ(n) edges 23 / 26
93 Technical Details 1 Black-box reduction from SSSP to shortest transshipment only for exact solutions 24 / 26
94 Technical Details 1 Black-box reduction from SSSP to shortest transshipment only for exact solutions 2 Transshipment will only guarantee (1 + ε)-approximation on average 24 / 26
95 Technical Details 1 Black-box reduction from SSSP to shortest transshipment only for exact solutions 2 Transshipment will only guarantee (1 + ε)-approximation on average 3 How to obtain per-node guarantee: Solve with increased precision Inspect gradient to identify good nodes Repeat transshipment for bad nodes only Analysis: Total mass reduced by constant fraction in each run 24 / 26
96 Technical Details 1 Black-box reduction from SSSP to shortest transshipment only for exact solutions 2 Transshipment will only guarantee (1 + ε)-approximation on average 3 How to obtain per-node guarantee: Solve with increased precision Inspect gradient to identify good nodes Repeat transshipment for bad nodes only Analysis: Total mass reduced by constant fraction in each run Independent work: Approximate transshipment [Sherman 16] 24 / 26
97 Technical Details 1 Black-box reduction from SSSP to shortest transshipment only for exact solutions 2 Transshipment will only guarantee (1 + ε)-approximation on average 3 How to obtain per-node guarantee: Solve with increased precision Inspect gradient to identify good nodes Repeat transshipment for bad nodes only Analysis: Total mass reduced by constant fraction in each run Independent work: Approximate transshipment [Sherman 16] More general solvers based on generalized preconditioning 24 / 26
98 Technical Details 1 Black-box reduction from SSSP to shortest transshipment only for exact solutions 2 Transshipment will only guarantee (1 + ε)-approximation on average 3 How to obtain per-node guarantee: Solve with increased precision Inspect gradient to identify good nodes Repeat transshipment for bad nodes only Analysis: Total mass reduced by constant fraction in each run Independent work: Approximate transshipment [Sherman 16] More general solvers based on generalized preconditioning Linear preconditioner based on metric embeddings 24 / 26
99 Technical Details 1 Black-box reduction from SSSP to shortest transshipment only for exact solutions 2 Transshipment will only guarantee (1 + ε)-approximation on average 3 How to obtain per-node guarantee: Solve with increased precision Inspect gradient to identify good nodes Repeat transshipment for bad nodes only Analysis: Total mass reduced by constant fraction in each run Independent work: Approximate transshipment [Sherman 16] More general solvers based on generalized preconditioning Linear preconditioner based on metric embeddings With additional analysis: spanner-based oracle as non-linear preconditioner 24 / 26
100 Technical Details 1 Black-box reduction from SSSP to shortest transshipment only for exact solutions 2 Transshipment will only guarantee (1 + ε)-approximation on average 3 How to obtain per-node guarantee: Solve with increased precision Inspect gradient to identify good nodes Repeat transshipment for bad nodes only Analysis: Total mass reduced by constant fraction in each run Independent work: Approximate transshipment [Sherman 16] More general solvers based on generalized preconditioning Linear preconditioner based on metric embeddings With additional analysis: spanner-based oracle as non-linear preconditioner No straightforward way of obtaining per-node guarantee 24 / 26
101 Conclusion Main contributions: Two almost tight algorithms in distributed and streaming models Combinatorial and continuous tools 25 / 26
102 Conclusion Main contributions: Two almost tight algorithms in distributed and streaming models Combinatorial and continuous tools Open problems: PRAM: improve Cohen s m 1+o(1) work with polylog depth? Deterministic decremental SSSP algorithm 25 / 26
103 Tight and Tighter 26 / 26
A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths
A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths Monika Henzinger 1 Sebastian Krinninger 2 Danupon Nanongkai 3 1 University of Vienna 2 Max Planck Institute
More informationNear-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models
Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models Ruben Becker 1, Andreas Karrenbauer 1, Sebastian Krinninger 2, and Christoph Lenzen 1 1 Max Planck Institute
More informationDistributed Distance-Bounded Network Design Through Distributed Convex Programming
Distributed Distance-Bounded Network Design Through Distributed Convex Programming OPODIS 2017 Michael Dinitz, Yasamin Nazari Johns Hopkins University December 18, 2017 Distance Bounded Network Design
More informationDistributed Exact Weighted All-Pairs Shortest Paths in Õ(n5/4 ) Rounds
58th Annual IEEE Symposium on Foundations of Computer Science Distributed Exact Weighted All-Pairs Shortest Paths in Õ(n5/4 ) Rounds Chien-Chung Huang CNRS, École Normale Supérieure France Danupon Nanongkai
More informationAn Overview on Compact Routing
An Overview on Compact Routing Cyril Gavoille 1 1 University of Bordeaux, France 2-6 October 2006 2nd Research Workshop on Flexible Network Design University of Bologna Residential Center Bertinoro (Forlì),
More informationOn the Locality of Distributed Sparse Spanner Constructions
On the Locality of Distributed Sparse Spanner Constructions B. Derbel, C. Gavoille, D. Peleg, L. Viennot University of Lille University of Bordeaux Weizmann Institute INRIA, Paris PODC 2008 Toronto What
More informationApproximating Graph Spanners
Approximating Graph Spanners Michael Dinitz Johns Hopkins University Joint work with combinations of Robert Krauthgamer (Weizmann), Eden Chlamtáč (Ben Gurion), Ran Raz (Weizmann), Guy Kortsarz (Rutgers-Camden)
More informationDistributed Distance Computation and Routing with Small Messages
Distributed Computing manuscript No. (will be inserted by the editor) Distributed Distance Computation and Routing with Small Messages Christoph Lenzen Boaz Patt-Shamir David Peleg Abstract We consider
More informationA Subquadratic-Time Algorithm for Decremental Single-Source Shortest Paths
A Subquadratic-Time Algorithm for Decremental Single-Source Shortest Paths Monika Henzinger Sebastian Krinninger Danupon Nanongkai Abstract We study dynamic (1 + ɛ)-approximation algorithms for the single-source
More informationFast Partial Distance Estimation and Applications
Fast Partial Distance Estimation and Applications Christoph Lenzen MPI for Informatics Saabrücken, Germany clenzen@mpi-inf.mpg.de Boaz Patt-Shamir Tel Aviv University Tel Aviv, Israel boaz@tau.ac.il ABSTRACT
More informationComplexity Theory of Polynomial-Time Problems
Complexity Theory of Polynomial-Time Problems Lecture 3: The polynomial method Part I: Orthogonal Vectors Sebastian Krinninger Organization of lecture No lecture on 26.05. (State holiday) 2 nd exercise
More informationDominating Set. Chapter 26
Chapter 26 Dominating Set In this chapter we present another randomized algorithm that demonstrates the power of randomization to break symmetries. We study the problem of finding a small dominating set
More informationDominating Set. Chapter Sequential Greedy Algorithm 294 CHAPTER 26. DOMINATING SET
294 CHAPTER 26. DOMINATING SET 26.1 Sequential Greedy Algorithm Chapter 26 Dominating Set Intuitively, to end up with a small dominating set S, nodes in S need to cover as many neighbors as possible. It
More informationScribes: Po-Hsuan Wei, William Kuzmaul Editor: Kevin Wu Date: October 18, 2016
CS 267 Lecture 7 Graph Spanners Scribes: Po-Hsuan Wei, William Kuzmaul Editor: Kevin Wu Date: October 18, 2016 1 Graph Spanners Our goal is to compress information about distances in a graph by looking
More informationDominating Set. Chapter 7
Chapter 7 Dominating Set In this chapter we present another randomized algorithm that demonstrates the power of randomization to break symmetries. We study the problem of finding a small dominating set
More informationLocal Flow Partitioning for Faster Edge Connectivity
Local Flow Partitioning for Faster Edge Connectivity Monika Henzinger, Satish Rao, Di Wang University of Vienna, UC Berkeley, UC Berkeley Edge Connectivity Edge-connectivity λ: least number of edges whose
More informationShortest Path Algorithms
Shortest Path Algorithms Andreas Klappenecker [based on slides by Prof. Welch] 1 Single Source Shortest Path 2 Single Source Shortest Path Given: a directed or undirected graph G = (V,E) a source node
More informationLocality Lower Bounds
Chapter 8 Locality Lower Bounds In Chapter 1, we looked at distributed algorithms for coloring. In particular, we saw that rings and rooted trees can be colored with 3 colors in log n + O(1) rounds. 8.1
More informationDistributed Deterministic Graph Coloring
Distributed Deterministic Graph Coloring Michael Elkin Ben-Gurion University + 1 The Model Unweighted undirected graph G = (V, E). Vertices host processors. Processors communicate over edges of G. Communication
More informationCollective Tree Spanners of Unit Disk Graphs with Applications to Compact and Low Delay Routing Labeling Schemes. F.F. Dragan
Collective Tree Spanners of Unit Disk Graphs with Applications to Compact and Low Delay Routing Labeling Schemes F.F. Dragan (joint work with Yang Xiang and Chenyu Yan) Kent State University, USA Well-known
More informationarxiv: v1 [cs.dc] 22 May 2017
Symmetry Breaking in the Congest Model: Timeand Message-Efficient Algorithms for Ruling Sets Shreyas Pai, Gopal Pandurangan 2, Sriram V. Pemmaraju, Talal Riaz, and Peter Robinson 3 arxiv:705.0786v [cs.dc]
More informationGraph & Geometry Problems in Data Streams
Graph & Geometry Problems in Data Streams 2009 Barbados Workshop on Computational Complexity Andrew McGregor Introduction Models: Graph Streams: Stream of edges E = {e 1, e 2,..., e m } describe a graph
More informationDijkstra s Single Source Shortest Path Algorithm. Andreas Klappenecker
Dijkstra s Single Source Shortest Path Algorithm Andreas Klappenecker Single Source Shortest Path Given: a directed or undirected graph G = (V,E) a source node s in V a weight function w: E -> R. Goal:
More informationA Lower Bound for the Distributed Lovász Local Lemma
A Lower Bound for the Distributed Lovász Local Lemma Sebastian Brandt, Orr Fischer, Juho Hirvonen, Barbara Keller, Tuomo Lempiäinen, Joel Rybicki, Jukka Suomela, Jara Uitto Aalto University, Comerge AG,
More informationNetworks Cannot Compute Their Diameter in Sublinear Time
Networks Cannot Compute Their Diameter in Sublinear Time Preliminary version, please check for updates Silvio Frischknecht Stephan Holzer Roger Wattenhofer {fsilvio, stholzer, wattenhofer}@ethzch Computer
More informationHardness of MST Construction
Lecture 7 Hardness of MST Construction In the previous lecture, we saw that an MST can be computed in O( n log n+ D) rounds using messages of size O(log n). Trivially, Ω(D) rounds are required, but what
More informationarxiv: v6 [cs.dc] 16 Sep 2015
Distributed Computation of Large-scale Graph Problems Hartmut Klauck Danupon Nanongkai Gopal Pandurangan Peter Robinson arxiv:1311.6209v6 [cs.dc] 16 Sep 2015 Abstract Motivated by the increasing need for
More informationDynamic Programming: Shortest Paths and DFA to Reg Exps
CS 374: Algorithms & Models of Computation, Spring 207 Dynamic Programming: Shortest Paths and DFA to Reg Exps Lecture 8 March 28, 207 Chandra Chekuri (UIUC) CS374 Spring 207 / 56 Part I Shortest Paths
More informationRouting. Topics: 6.976/ESD.937 1
Routing Topics: Definition Architecture for routing data plane algorithm Current routing algorithm control plane algorithm Optimal routing algorithm known algorithms and implementation issues new solution
More informationEfficient Primal- Dual Graph Algorithms for Map Reduce
Efficient Primal- Dual Graph Algorithms for Map Reduce Joint work with Bahman Bahmani Ashish Goel, Stanford Kamesh Munagala Duke University Modern Data Models Over the past decade, many commodity distributed
More informationSecond main application of Chernoff: analysis of load balancing. Already saw balls in bins example. oblivious algorithms only consider self packet.
Routing Second main application of Chernoff: analysis of load balancing. Already saw balls in bins example synchronous message passing bidirectional links, one message per step queues on links permutation
More informationWeek 4. (1) 0 f ij u ij.
Week 4 1 Network Flow Chapter 7 of the book is about optimisation problems on networks. Section 7.1 gives a quick introduction to the definitions of graph theory. In fact I hope these are already known
More informationGossip algorithms for solving Laplacian systems
Gossip algorithms for solving Laplacian systems Anastasios Zouzias University of Toronto joint work with Nikolaos Freris (EPFL) Based on : 1.Fast Distributed Smoothing for Clock Synchronization (CDC 1).Randomized
More informationDynamic Programming: Shortest Paths and DFA to Reg Exps
CS 374: Algorithms & Models of Computation, Fall 205 Dynamic Programming: Shortest Paths and DFA to Reg Exps Lecture 7 October 22, 205 Chandra & Manoj (UIUC) CS374 Fall 205 / 54 Part I Shortest Paths with
More informationBasics and Random Graphs con0nued
Basics and Random Graphs con0nued Social and Technological Networks Rik Sarkar University of Edinburgh, 2017. Random graphs on jupyter notebook Solu0on to exercises 1 is out If your BSc/MSc/PhD work is
More informationarxiv: v1 [cs.ds] 20 Nov 2015
Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture Monika Henzinger University of Vienna, Austria Faculty of Computer Science Danupon Nanongkai
More informationGRAPH PARTITIONING USING SINGLE COMMODITY FLOWS [KRV 06] 1. Preliminaries
GRAPH PARTITIONING USING SINGLE COMMODITY FLOWS [KRV 06] notes by Petar MAYMOUNKOV Theme The algorithmic problem of finding a sparsest cut is related to the combinatorial problem of building expander graphs
More informationCS675: Convex and Combinatorial Optimization Fall 2014 Combinatorial Problems as Linear Programs. Instructor: Shaddin Dughmi
CS675: Convex and Combinatorial Optimization Fall 2014 Combinatorial Problems as Linear Programs Instructor: Shaddin Dughmi Outline 1 Introduction 2 Shortest Path 3 Algorithms for Single-Source Shortest
More informationTime Synchronization
Massachusetts Institute of Technology Lecture 7 6.895: Advanced Distributed Algorithms March 6, 2006 Professor Nancy Lynch Time Synchronization Readings: Fan, Lynch. Gradient clock synchronization Attiya,
More informationPRAMs. M 1 M 2 M p. globaler Speicher
PRAMs A PRAM (parallel random access machine) consists of p many identical processors M,..., M p (RAMs). Processors can read from/write to a shared (global) memory. Processors work synchronously. M M 2
More informationDiscrete Optimization 2010 Lecture 2 Matroids & Shortest Paths
Matroids Shortest Paths Discrete Optimization 2010 Lecture 2 Matroids & Shortest Paths Marc Uetz University of Twente m.uetz@utwente.nl Lecture 2: sheet 1 / 25 Marc Uetz Discrete Optimization Matroids
More information6.852: Distributed Algorithms Fall, Class 10
6.852: Distributed Algorithms Fall, 2009 Class 10 Today s plan Simulating synchronous algorithms in asynchronous networks Synchronizers Lower bound for global synchronization Reading: Chapter 16 Next:
More informationApproximation Algorithms and Hardness of Integral Concurrent Flow
Approximation Algorithms and Hardness of Integral Concurrent Flow Parinya Chalermsook Julia Chuzhoy Alina Ene Shi Li May 16, 2012 Abstract We study an integral counterpart of the classical Maximum Concurrent
More informationBhaskar DasGupta. March 28, 2016
Node Expansions and Cuts in Gromov-hyperbolic Graphs Bhaskar DasGupta Department of Computer Science University of Illinois at Chicago Chicago, IL 60607, USA bdasgup@uic.edu March 28, 2016 Joint work with
More information3.4 Relaxations and bounds
3.4 Relaxations and bounds Consider a generic Discrete Optimization problem z = min{c(x) : x X} with an optimal solution x X. In general, the algorithms generate not only a decreasing sequence of upper
More informationComplexity Theory of Polynomial-Time Problems
Complexity Theory of Polynomial-Time Problems Lecture 8: (Boolean) Matrix Multiplication Karl Bringmann Recall: Boolean Matrix Multiplication given n n matrices A, B with entries in {0,1} compute matrix
More informationGraph-theoretic Problems
Graph-theoretic Problems Parallel algorithms for fundamental graph-theoretic problems: We already used a parallelization of dynamic programming to solve the all-pairs-shortest-path problem. Here we are
More informationLower Bounds for Local Monotonicity Reconstruction from Transitive-Closure Spanners
Lower Bounds for Local Monotonicity Reconstruction from Transitive-Closure Spanners Arnab Bhattacharyya 1, Elena Grigorescu 1, Madhav Jha 2, Kyomin Jung 3, Sofya Raskhodnikova 2, and David P. Woodruff
More informationCS675: Convex and Combinatorial Optimization Fall 2016 Combinatorial Problems as Linear and Convex Programs. Instructor: Shaddin Dughmi
CS675: Convex and Combinatorial Optimization Fall 2016 Combinatorial Problems as Linear and Convex Programs Instructor: Shaddin Dughmi Outline 1 Introduction 2 Shortest Path 3 Algorithms for Single-Source
More informationarxiv: v1 [cs.dc] 4 Oct 2018
Distributed Reconfiguration of Maximal Independent Sets Keren Censor-Hillel 1 and Mikael Rabie 2 1 Department of Computer Science, Technion, Israel, ckeren@cs.technion.ac.il 2 Aalto University, Helsinki,
More informationA Practical Parallel Algorithm for Diameter Approximation of Massive Weighted Graphs
A Practical Parallel Algorithm for Diameter Approximation of Massive Weighted Graphs Matteo Ceccarello Joint work with Andrea Pietracaprina, Geppino Pucci, and Eli Upfal Università di Padova Brown University
More informationSublinear Algorithms for Big Data
Sublinear Algorithms for Big Data Qin Zhang 1-1 2-1 Part 2: Sublinear in Communication Sublinear in communication The model x 1 = 010011 x 2 = 111011 x 3 = 111111 x k = 100011 Applicaitons They want to
More informationStructuring Unreliable Radio Networks
Structuring Unreliable Radio Networks Keren Censor-Hillel Seth Gilbert Fabian Kuhn Nancy Lynch Calvin Newport August 25, 2013 Abstract In this paper we study the problem of building a constant-degree connected
More informationSlides credited from Hsueh-I Lu & Hsu-Chun Hsiao
Slides credited from Hsueh-I Lu & Hsu-Chun Hsiao Homework 3 released Due on 12/13 (Thur) 14:20 (one week only) Mini-HW 9 released Due on 12/13 (Thur) 14:20 Homework 4 released Due on 1/3 (Thur) 14:20 (four
More informationarxiv: v1 [cs.ds] 15 May 2016
Improved distance sensitivity oracles via tree partitioning Ran Duan 1 and Tianyi Zhang 2 arxiv:1605.04491v1 [cs.ds] 15 May 2016 1 Institute for Interdisciplinary Information Science, Tsinghua University,
More informationDantzig s pivoting rule for shortest paths, deterministic MDPs, and minimum cost to time ratio cycles
Dantzig s pivoting rule for shortest paths, deterministic MDPs, and minimum cost to time ratio cycles Thomas Dueholm Hansen 1 Haim Kaplan Uri Zwick 1 Department of Management Science and Engineering, Stanford
More informationLight Spanners. 1 Introduction. Michael Elkin Ofer Neiman Shay Solomon
Light Spanners Michael Elkin Ofer Neiman Shay Solomon Abstract A t-spanner of a weighted undirected graph G = (V, E), is a subgraph H such that d H (u, v) t d G (u, v) for all u, v V. The sparseness of
More informationSteiner Transitive-Closure Spanners of Low-Dimensional Posets
Steiner Transitive-Closure Spanners of Low-Dimensional Posets Grigory Yaroslavtsev Pennsylvania State University + AT&T Labs Research (intern) Joint with P. Berman (PSU), A. Bhattacharyya (MIT), E. Grigorescu
More informationNew algorithms for Disjoint Paths and Routing Problems
New algorithms for Disjoint Paths and Routing Problems Chandra Chekuri Dept. of Computer Science Univ. of Illinois (UIUC) Menger s Theorem Theorem: The maximum number of s-t edgedisjoint paths in a graph
More informationMetric Approximations (Embeddings) M M 1 2 f M 1, M 2 metric spaces. f injective mapping from M 1 to M 2. M 2 dominates M 1 under f if d M1 (u; v) d M
Approximating a nite metric by a small number of tree metrics Moses Charikar Chandra Chekuri Ashish Goel Sudipto Guha Serge Plotkin Metric Approximations (Embeddings) M M 1 2 f M 1, M 2 metric spaces.
More informationNP-completeness. Chapter 34. Sergey Bereg
NP-completeness Chapter 34 Sergey Bereg Oct 2017 Examples Some problems admit polynomial time algorithms, i.e. O(n k ) running time where n is the input size. We will study a class of NP-complete problems
More informationEfficient Algorithms for Constructing Very Sparse Spanners and Emulators
Efficient Algorithms for Constructing Very Sparse Spanners and Emulators Michael Elkin 1 and Ofer Neiman 1 1 Department of Computer Science, Ben-Gurion University of the Negev, Beer-Sheva, Israel. Email:
More informationApproximating All-Pair Bounded-Leg Shortest Path and APSP-AF in Truly-Subcubic Time
Approximating All-Pair Bounded-Leg Shortest Path and APSP-AF in Truly-Subcubic Time Ran Duan 1 Institute for Interdisciplinary Information Sciences, Tsinghua University, China duanran@mail.tsinghua.edu.cn
More informationvariance of independent variables: sum of variances So chebyshev predicts won t stray beyond stdev.
Announcements No class monday. Metric embedding seminar. Review expectation notion of high probability. Markov. Today: Book 4.1, 3.3, 4.2 Chebyshev. Remind variance, standard deviation. σ 2 = E[(X µ X
More information- Well-characterized problems, min-max relations, approximate certificates. - LP problems in the standard form, primal and dual linear programs
LP-Duality ( Approximation Algorithms by V. Vazirani, Chapter 12) - Well-characterized problems, min-max relations, approximate certificates - LP problems in the standard form, primal and dual linear programs
More informationInderjit Dhillon The University of Texas at Austin
Inderjit Dhillon The University of Texas at Austin ( Universidad Carlos III de Madrid; 15 th June, 2012) (Based on joint work with J. Brickell, S. Sra, J. Tropp) Introduction 2 / 29 Notion of distance
More informationTheoretical Computer Science
Theoretical Computer Science 411 (010) 417 44 Contents lists available at ScienceDirect Theoretical Computer Science journal homepage: wwwelseviercom/locate/tcs Resource allocation with time intervals
More informationSpanning Trees, Tree Covers and Spanners
Spanning Trees, Tree Covers and Spanners Consider a weighted connected graph G=(V, E, w), where w:e R assigns a nonnegative weight w(e) to each edge e, representing its length. In the following we only
More informationLower-Stretch Spanning Trees
Lower-Stretch Spanning Trees Michael Elkin Ben-Gurion University Joint work with Yuval Emek, Weizmann Institute Dan Spielman, Yale University Shang-Hua Teng, Boston University + 1 The Setting G = (V, E,
More informationIn the Stone Age. Stephan Holzer. Yuval Emek - Technion Roger Wattenhofer - ETH Zürich
The Power of a Leader In the Stone Age - MIT Yuval Emek - Technion Roger Wattenhofer - ETH Zürich 2nd Workshop on Biological Distributed Algorithms, October 11-12, 2014 in Austin, Texas USA The Power of
More informationImproved Distributed Steiner Forest Construction
Improved Distributed Steiner Forest Construction Christoph Lenzen Boaz Patt-Shamir Abstract arxiv:1405.2011v1 [cs.dc] 8 May 2014 We present new distributed algorithms for constructing a Steiner Forest
More informationDesign and Analysis of Algorithms
Design and Analysis of Algorithms CSE 5311 Lecture 21 Single-Source Shortest Paths Junzhou Huang, Ph.D. Department of Computer Science and Engineering CSE5311 Design and Analysis of Algorithms 1 Single-Source
More informationarxiv: v1 [cs.ds] 4 May 2015
Dual Failure Resilient BFS Structure Merav Parter arxiv:1505.00692v1 [cs.ds] 4 May 2015 Abstract We study breadth-first search (BFS) spanning trees, and address the problem of designing a sparse fault-tolerant
More informationTopic: Balanced Cut, Sparsest Cut, and Metric Embeddings Date: 3/21/2007
CS880: Approximations Algorithms Scribe: Tom Watson Lecturer: Shuchi Chawla Topic: Balanced Cut, Sparsest Cut, and Metric Embeddings Date: 3/21/2007 In the last lecture, we described an O(log k log D)-approximation
More informationThe Lovász Local Lemma: constructive aspects, stronger variants and the hard core model
The Lovász Local Lemma: constructive aspects, stronger variants and the hard core model Jan Vondrák 1 1 Dept. of Mathematics Stanford University joint work with Nick Harvey (UBC) The Lovász Local Lemma
More informationIncremental Exact Min-Cut in Poly-logarithmic Amortized Update Time
Incremental Exact Min-Cut in Poly-logarithmic Amortized Update Time Gramoz Goranci Monika Henzinger Mikkel Thorup Abstract We present a deterministic incremental algorithm for exactly maintaining the size
More informationLocal Computation: Lower and Upper Bounds 1
Local Computation: Lower and Upper Bounds 1 Fabian Kuhn 1, Thomas Moscibroda 2, Roger Wattenhofer 3 1 fkuhn@csail.mit.edu, MIT, USA 2 moscitho@microsoft.com, Microsoft Research, Redmond, USA 3 wattenhofer@tik.ee.ethz.ch,
More informationGraph Sparsification I : Effective Resistance Sampling
Graph Sparsification I : Effective Resistance Sampling Nikhil Srivastava Microsoft Research India Simons Institute, August 26 2014 Graphs G G=(V,E,w) undirected V = n w: E R + Sparsification Approximate
More informationMinimum Distance Violation Tree Problems
Minimum Distance Violation Tree Problems Hui Chen Department of Management Sciences University of Iowa S221 John Pappajohn Business Building Iowa City, Iowa 52242-1000 hui-chen@uiowa.edu Ph.D Dissertation
More informationNew Lower Bounds for the CONGEST Model. Seri Khoury
New Lower Bounds for the CONGEST Model Seri Khoury New Lower Bounds for the CONGEST Model Research Thesis Submitted in partial fulfillment of the requirements for the degree of Master of Science in Computer
More informationEdinburgh Research Explorer
Edinburgh Research Explorer On the power of the congested clique model Citation for published version: Drucker, A, Kuhn, F & Oshman, R 2014, On the power of the congested clique model. in ACM Symposium
More informationClock Synchronization with Bounded Global and Local Skew
Clock Synchronization with ounded Global and Local Skew Distributed Computing Christoph Lenzen, ETH Zurich Thomas Locher, ETH Zurich Roger Wattenhofer, ETH Zurich October 2008 Motivation: No Global Clock
More informationConvergence and Approximation in Potential Games
Convergence and Approximation in Potential Games George Christodoulou 1, Vahab S. Mirrokni 2, and Anastasios Sidiropoulos 2 1 National and Kapodistrian University of Athens Dept. of Informatics and Telecommunications
More informationhttp://www.diva-portal.org This is [Version unknown!] version of a paper presented at STOC '15 Symposium on Theory of Computing (part of FCRC) Portland, OR, USA June 14-17, 2015. Citation for the original
More informationAlgorithms and Models for Problems in Networking
Algorithms and Models for Problems in Networking Michael Dinitz May 13, 2010 School of Computer Science Carnegie Mellon University Pittsburgh, PA 15213 Thesis Committee: Anupam Gupta, Chair Avrim Blum
More informationLecture: Flow-based Methods for Partitioning Graphs (1 of 2)
Stat260/CS294: Spectral Graph Methods Lecture 10-02/24/2015 Lecture: Flow-based Methods for Partitioning Graphs (1 of 2) Lecturer: Michael Mahoney Scribe: Michael Mahoney Warning: these notes are still
More informationU.C. Berkeley CS294: Spectral Methods and Expanders Handout 11 Luca Trevisan February 29, 2016
U.C. Berkeley CS294: Spectral Methods and Expanders Handout Luca Trevisan February 29, 206 Lecture : ARV In which we introduce semi-definite programming and a semi-definite programming relaxation of sparsest
More informationCutting Plane Methods II
6.859/5.083 Integer Programming and Combinatorial Optimization Fall 2009 Cutting Plane Methods II Gomory-Chvátal cuts Reminder P = {x R n : Ax b} with A Z m n, b Z m. For λ [0, ) m such that λ A Z n, (λ
More informationCS599: Convex and Combinatorial Optimization Fall 2013 Lecture 17: Combinatorial Problems as Linear Programs III. Instructor: Shaddin Dughmi
CS599: Convex and Combinatorial Optimization Fall 2013 Lecture 17: Combinatorial Problems as Linear Programs III Instructor: Shaddin Dughmi Announcements Today: Spanning Trees and Flows Flexibility awarded
More informationComputing Maximum Flow with Augmenting Electrical Flows
Computing Maximum Flow with Augmenting Electrical Flows Aleksander Mądry MIT madry@mit.edu Abstract ( ) We present an Õ m 0 7 U 7 -time algorithm for the maximum s-t flow problem (and the minimum s-t cut
More information16.1 Min-Cut as an LP
600.469 / 600.669 Approximation Algorithms Lecturer: Michael Dinitz Topic: LPs as Metrics: Min Cut and Multiway Cut Date: 4//5 Scribe: Gabriel Kaptchuk 6. Min-Cut as an LP We recall the basic definition
More informationSingle Source Shortest Paths
CMPS 00 Fall 017 Single Source Shortest Paths Carola Wenk Slides courtesy of Charles Leiserson with changes and additions by Carola Wenk Paths in graphs Consider a digraph G = (V, E) with an edge-weight
More informationCMPSCI 611: Advanced Algorithms
CMPSCI 611: Advanced Algorithms Lecture 12: Network Flow Part II Andrew McGregor Last Compiled: December 14, 2017 1/26 Definitions Input: Directed Graph G = (V, E) Capacities C(u, v) > 0 for (u, v) E and
More informationLecture 6: September 22
CS294 Markov Chain Monte Carlo: Foundations & Applications Fall 2009 Lecture 6: September 22 Lecturer: Prof. Alistair Sinclair Scribes: Alistair Sinclair Disclaimer: These notes have not been subjected
More informationLecture 15 (Oct 6): LP Duality
CMPUT 675: Approximation Algorithms Fall 2014 Lecturer: Zachary Friggstad Lecture 15 (Oct 6): LP Duality Scribe: Zachary Friggstad 15.1 Introduction by Example Given a linear program and a feasible solution
More informationDistributed primal-dual approximation algorithms for network design problems
Distributed primal-dual approximation algorithms for network design problems Zeev Nutov The Open University of Israel nutov@openu.ac.il Amir Sadeh The Open University of Israel amirsadeh@yahoo.com Abstract
More informationDiscrete Wiskunde II. Lecture 5: Shortest Paths & Spanning Trees
, 2009 Lecture 5: Shortest Paths & Spanning Trees University of Twente m.uetz@utwente.nl wwwhome.math.utwente.nl/~uetzm/dw/ Shortest Path Problem "#$%&'%()*%"()$#+,&- Given directed "#$%&'()*+,%+('-*.#/'01234564'.*,'7+"-%/8',&'5"4'84%#3
More informationarxiv: v2 [cs.ds] 5 Apr 2014
Simple, Fast and Deterministic Gossip and Rumor Spreading Bernhard Haeupler Microsoft Research haeupler@cs.cmu.edu arxiv:20.93v2 [cs.ds] 5 Apr 204 Abstract We study gossip algorithms for the rumor spreading
More informationGraph-Constrained Group Testing
Mahdi Cheraghchi et al. presented by Ying Xuan May 20, 2010 Table of contents 1 Motivation and Problem Definitions 2 3 Correctness Proof 4 Applications call for connected pools detection of congested links
More informationDistributed Systems Gossip Algorithms
Distributed Systems Gossip Algorithms He Sun School of Informatics University of Edinburgh What is Gossip? Gossip algorithms In a gossip algorithm, each node in the network periodically exchanges information
More information