Excluded minors, network decomposition, and multicommodity flow
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Steiner points in tree metrics don't (really) help
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
An improved approximation algorithm for the 0-extension problem
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Approximate classification via earthmover metrics
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Cuts, Trees and ℓ1-Embeddings of Graphs*
Combinatorica
A tight bound on approximating arbitrary metrics by tree metrics
Journal of Computer and System Sciences - Special issue: STOC 2003
Approximation Algorithms for the 0-Extension Problem
SIAM Journal on Computing
Optimal hierarchical decompositions for congestion minimization in networks
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
On the geometry of graphs with a forbidden minor
Proceedings of the forty-first annual ACM symposium on Theory of computing
FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
Extensions and limits to vertex sparsification
Proceedings of the forty-second ACM symposium on Theory of computing
An improved approximation algorithm for requirement cut
Operations Research Letters
Approximation algorithms and hardness of the k-route cut problem
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
On vertex sparsifiers with Steiner nodes
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Routing in undirected graphs with constant congestion
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Preserving terminal distances using minors
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Flow-cut gaps for integer and fractional multiflows
Journal of Combinatorial Theory Series B
A node-capacitated okamura-seymour theorem
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Hi-index | 0.01 |
Given a capacitated graph G = (V, E) and a set of terminals K ⊆ V, how should we produce a graph H only on the terminals K so that every (multicommodity) flow between the terminals in G could be supported in H with low congestion, and vice versa? (Such a graph H is called a flow-sparsifier for G.) What if we want H to be a "simple" graph? What if we allow H to be a convex combination of simple graphs? Improving on results of Moitra [FOCS 2009] and Leighton and Moitra [STOC 2010], we give efficient algorithms for constructing: (a) a flow-sparsifier H that maintains congestion up to a factor ofO(log k/log log k) where k = |K|. (b) a convex combination of trees over the terminals K that maintains congestion up to a factor of O(log k). (c) for a planar graph G, a convex combination of planar graphs that maintains congestion up to a constant factor. This requires us to give a new algorithm for the 0-extension problem, the first one in which the preimages of each terminal are connected in G. Moreover, this result extends to minor-closed families of graphs. Our bounds immediately imply improved approximation guarantees for several terminal-based cut and ordering problems.