Mittagsseminar (in cooperation with J. Lengler, A. Steger, and D. Steurer)

Date and Time: Thursday, November 20, 2025, 12:15 pm

Duration: 30 minutes

Location: OAT S15

Speaker: Tim Rieder

Random-Shift revisited: Tight Approximations for Tree Embeddings and L1-Oblivious Routings

We present a new and surprisingly simple analysis of random-shift decompositions—originally proposed by Miller, Peng, and Xu [SPAA’13]: We show that decompositions for exponentially growing scales D = 2⁰, 2¹, . . . , 2^log(diam(G)), have a tight constant trade-off between distance-to-center and separation probability on average across the distance scales – opposed to a necessary Ω(log n) trade-off for a single scale. This almost immediately yields a way to compute a tree T for graph G that preserves all graph distances with expected O(log n)-stretch. This gives an alternative proof that obtains tight approximation bounds of the seminal result by Fakcharoenphol, Rao, and Talwar [STOC’03] matching the Ω(log n) lower bound by Bartal [FOCS’96]. Our insights can also be used to refine the analysis of a simple ℓ1-oblivious routing proposed in [FOCS’22], yielding a tight O(log n) competitive ratio. Our algorithms for constructing tree embeddings and ℓ1-oblivious routings can be implemented in the sequential, parallel, and distributed settings with optimal work, depth, and rounds, up to polylogarithmic factors. Previously, fast algorithms with tight guarantees were not known for tree embeddings in parallel and distributed settings, and for ℓ1-oblivious routings, not even a fast sequential algorithm was known.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2025  2024  2023  2022  2021  2020  2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login