Seminar • Algorithms and Complexity — Dynamic Low-Stretch Trees via Dynamic Low-Diameter DecompositionsExport this event to calendar

Wednesday, March 6, 2019 — 1:30 PM EST

Gramoz Goranci, University of Vienna

Spanning trees of low average stretch on the non-tree edges are natural graph-theoretic objects that have found applications in fast solvers for symmetric diagonally dominant (SDD) linear systems, construction of competitive oblivious routing schemes and approximation algorithms.

In this talk, I will present the first non-trivial algorithm for maintaining such trees under edge insertions and deletions to the input graph. Our algorithm has update time n^{1/2+o(1)} and the average stretch of the maintained tree is n^{o(1)}, which matches the stretch in the seminal result of Alon et al. [SICOMP' 95]. The key ingredients to our result are (1) dynamic maintenance of low-diameter decompositions (LLDs), (2) controlling the propagation of updates within a hierarchy of dynamic LDDs, and (3) incorporation of dynamic cut sparsifiers to improve the update time.

This is joint work with Sebastian Forster, and will appear at STOC 2019.

Location 
DC - William G. Davis Computer Research Centre
1304
200 University Avenue West

Waterloo, ON N2L 3G1
Canada

S M T W T F S
28
29
30
31
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
  1. 2019 (179)
    1. September (6)
    2. August (18)
    3. July (12)
    4. June (23)
    5. May (23)
    6. April (32)
    7. March (25)
    8. February (16)
    9. January (24)
  2. 2018 (221)
    1. December (16)
    2. November (19)
    3. October (26)
    4. September (23)
    5. August (17)
    6. July (20)
    7. June (13)
    8. May (25)
    9. April (34)
    10. March (24)
    11. February (3)
    12. January (1)
  3. 2017 (36)
  4. 2016 (21)
  5. 2015 (36)
  6. 2014 (33)
  7. 2013 (23)
  8. 2012 (4)
  9. 2011 (1)
  10. 2010 (1)
  11. 2009 (1)
  12. 2008 (1)