1. Hierarchical Decompositions for Congestion Minimization in Networks Harald Räcke 1

2. Approximation Tree Approximation

3. Approximating a Graph by a Tree Task: Given an (undirected) graph G. Compute a decomposition tree that is similar. decomposition tree:  bijection between leaf nodes of the tree and graph nodes embedding  each internal node is mapped to some graph node  tree edges are mapped to path in the graph between the corresponding endpoints 3 abcdefghij a g b e i j f h d c

4. Similarity 4

5. Unfortunately this does not work: Any tree will distort at least one edge/pair by a lot in a cycle. Solution: Convex combination of trees probability distribution over trees. What is the expected factor by which the length of an edge increases when choosing a random tree? Distance-based Decompositions 5

6. 6

7. Cut-based Decompositions 7

8. Part 1. Cut-based Decompositions 8 a g b e i j f h d c abcdefghij ce b h

9. Part 2. Cut-based Decompositions 9 abcdefghij ce i h a g b e i j f h d c

10. Part 1: simply make capacities in the tree large enough!!! Cut-based Decompositions 10 a g b e i j f h d c abcdefghij ce b h

11. Part 1: simply make capacities in the tree large enough!!! Cut-based Decompositions 11 a g b e i j f h d c abcdefghij ce b h

12. Part 2: Not possible. The high capacity tree edge is mapped to a single path. Cut-based Decompositions 12 a g b e i j f h d c abcdefghij ce b h

13. Cut-based Decompositions 13

14. Cut-based Decompositions 14

15. Cut-based Decompositions 15

16. Minimum Bisection black vertices white vertices

17. Minimum Bisection Minimum Bisection on leaf nodes of the tree: Color each leaf node either black or white such that each color is used the same number of times. Minimize total capacity of edges that you need to take out in order to disconnect black from white vertices.

18. Minimum Bisection Algorithm: For each tree in the support of the convex combination compute a minimum leaf bisection. Output the smallest bisection found. 18 tree is better network T* is optimal

19. Advantages of having a single tree Some applications seem to require a single tree. E.g. all-or-nothing multicommodity flow. Oblivious routing can be done with small routing tables (poly-logarithmic per edge). See Matthews talk…

20. Hierarchical Routing Scheme

21. intermediate clusters.

22. Questions Embedding: How are intermediate nodes chosen? How are routing paths between intermediate nodes chosen? Decomposition: How is the partitioning done?

23. Choosing Intermediate Nodes

25. Estimating Traffic

27. Choosing Routing Paths

28. Select routing paths according to this solution!

29. Observation

30. Goal

31. A Bad-Case Example

32. Precondition

33. Decomposition Theorem

34. The Algorithm Capacity of edges bet- ween different clusters decreases.

35. Further Results/Open Questions