Hierarchical graph decompositions play an important role in the design of approximation
and online algorithms for graph problems. This is mainly due to the fact that the results …

We introduce a new approach to the maximum flow problem in undirected, capacitated
graphs using congestion-approximators: easy-to-compute functions that approximate the …

Network Design is an active research area in the intersection of Combinatorial Optimization
and Theoretical Computer Science that focuses on problems arising in the realm of modern …

This paper studies the fundamental task of establishing routing paths in distributed networks.
We prove the existence of compact routing tables that store in each network-node few …

We introduce a notion for hierarchical graph clustering which we call the expander hierarchy
and show a fully dynamic algorithm for maintaining such a hierarchy on a graph with n …

A recent seminal result of Racke is that for any network there is an oblivious routing
algorithm with a polylog competitive ratio with respect to congestion. Unfortunately, Racke's …

We give the first O (m polylog (n)) time algorithms for approximating maximum flows in
undirected graphs and constructing polylog (n)-quality cut-approximating hierarchical tree …

We study a wide range of online graph and network optimization problems, focusing on
problems that arise in the study of connectivity and cuts in graphs. In a general online …

Given a subset A of vertices of an undirected graph G, the cut-improvement problem asks us
to find a subset S that is similar to A but has smaller conductance. An elegant algorithm for …

We present a general method of designing fast approximation algorithms for cut-based
minimization problems in undirected graphs. In particular, we develop a technique that given …