Random-Shift Revisited: Tight Approximations for Tree Embeddings and ℓ₁-Oblivious Routings.

Rasmus Kyng, Maximilian Probst Gutenberg, Tim Rieder

Browse the full FOCS paper archive.