Oblivious Routing for the Lp-norm

DOI10.1109/FOCS.2009.52zbMath1292.68125OpenAlexW2103635929MaRDI QIDQ5171160

Matthias Englert, Harald Räcke

Publication date: 25 July 2014

Published in: 2009 50th Annual IEEE Symposium on Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/focs.2009.52

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10)

Related Items (5)

Randomized oblivious integral routing for minimizing power cost ⋮ Decentralized Low-Stretch Trees via Low Diameter Graph Decompositions ⋮ Sparse Semi-Oblivious Routing: Few Random Paths Suffice ⋮ Bayesian generalized network design ⋮ Unnamed Item

This page was built for publication: Oblivious Routing for the Lp-norm