Optimal hierarchical decompositions for congestion minimization in networks

By Harald Räcke. Symposium on the Theory of Computing, 2008

309 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Computer Networks and Communications

View Paper: https://www.semanticscholar.org/paper/91fd2a9c8f1709d3da5201378631e44a228d7bb2

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

1. Aaron Sidford
2. Yin Tat Lee
3. Lorenzo Orecchia
4. Jonathan A. Kelner
5. Nicolas Loizou
6. Peter Richtárik
7. Mengdi Wang
8. Stephen J. Wright

In Computer Networks and Communications

1. Lorenzo Orecchia
2. Jonathan A. Kelner
3. Yin Tat Lee
4. Aaron Sidford

Citations in the corpus

• An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs , and its Multicommodity Generalizations (2013, background): “Therefore ρ p (A) = max D cong({AD}) opt(D) = max D∞ cong(AD ∞ ) opt(D ∞ ) = max x∈R E e∈E x e U −1 A χ e ∞ U −1 x ∞ = max x∈R E U −1 AB T x ∞ U −1 x ∞ = max x∈R E U −1 AB T U x ∞ x ∞ 4 Note that the oblivous routing strategies considered in [9] [15] [25] are all linear oblivious routing strategies.”
• The Design of Approximation Algorithms (2011, unknown): “3 are due to Räcke [244].”
• An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations (2013, background): “routing algorithms in [6] [13] [21] are all linear.”