Vertex sparsifiers: New results from old techniques

45Citations
Citations of this article
15Readers
Mendeley users who have this article in their library.

Abstract

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 [Proceedings of the 50th IEEE Symposium on Foundations of Computer Science , IEEE Computer Society, Los Alamitos, CA, 2009, pp. 3-12] and Leighton and Moitra [Proceedings of the 42nd ACM Symposium on Theory of Computing, ACM, New York, 2010, pp. 47-56], we give efficient algorithms for constructing (a) a flow sparsifier H that maintains congestion up to a factor of O ( 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.[[amp]]copy;2014 SIAM. Published by SIAM under the terms.

Cite

CITATION STYLE

APA

Englert, M., Gupta, A., Krauthgamer, R., R̈acke, H., Talgam-Cohen, I., & Talwar, K. (2014). Vertex sparsifiers: New results from old techniques. SIAM Journal on Computing, 43(4), 1239–1262. https://doi.org/10.1137/130908440

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free