Vertex Sparsifiers and Abstract Rounding Algorithms
Name
Leighton_Vertex sparsifiers.pdf
Size
392.98 KB
Format
Adobe PDF
Checksum (MD5)
8f4652c795be4a86c04976c0cf953068
Author(s)
Charikar, Moses
Leighton, Frank Thomson
Li, Shi
Moitra, Ankur
Date Issued
October 2010
Journal
Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science
Publisher
Institute of Electrical and Electronics Engineers
Citation
Charikar, Moses, Tom Leighton, Shi Li, and Ankur Moitra. “Vertex Sparsifiers and Abstract Rounding Algorithms.” In 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, 23-26 Oct. 2010, Las Vegas, NV. pp. 265-274. Institute of Electrical and Electronics Engineers, © 2010 IEEE.
Version
Final published version
Abstract
The notion of vertex sparsification (in particular cut-sparsification) is introduced in, where it was shown that for any graph G = (V, E) and any subset of k terminals K ⊂ V, there is a polynomial time algorithm to construct a graph H = (K, EH) on just the terminal set so that simultaneously for all cuts (A,K-A), the value of the minimum cut in G separating A from K-A is approximately the same as the value of the corresponding cut in H. Then approximation algorithms can be run directly on H as a proxy for running on G. We give the first super-constant lower bounds for how well a cut-sparsifier H can simultaneously approximate all minimum cuts in G. We prove a lower bound of Ω(log1/4 k) this is polynomially-related to the known upper bound of O(log k/log log k). Independently, a similar lower bound is given in. This is an exponential improvement on the Ω(log log k) bound given in which in fact was for a stronger vertex sparsification guarantee, and did not apply to cut sparsifiers. Despite this negative result, we show that for many natural optimization problems, we do not need to incur a multiplicative penalty for our reduction. Roughly, we show that any rounding algorithm which also works for the O-extension relaxation can be used to construct good vertex-sparsifiers for which the optimization problem is easy. Using this, we obtain optimal O(log k)-competitive Steiner oblivious routing schemes, which generalize the results in. We also demonstrate that for a wide range of graph packing problems (which includes maximum concurrent flow, maximum multiflow and multicast routing, among others, as a special case), the integrality gap of the linear program is always at most O(log k) times the integrality gap restricted to trees. Lastly, we use our ideas to give an efficient construction for vertex-sparsifiers that match the current best existential results - this was previously open. Our algorithm makes novel use of Earth-mover- - constraints.
MIT Department
Massachusetts Institute of Technology. Department of Mathematics
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/FOCS.2010.32
