Improved Guarantees for Tree Cut Sparsifiers

Harrelson, Hildrum and Rao [11] construct for a given graph a single tree that acts as a flow sparsifier, i.e., it can approximate multicommodity flows in G up to an O(log 2 nloglog n) factor. Many applications that use these trees do not actually require a flow sparsifier but would already work with just having a cut sparsifier. We show how to construct a cut sparsifier that is a single tree and has quality O(log 1.5 nloglog n).

[1]  Harald Räcke,et al.  Minimizing Congestion in General Networks , 2002, FOCS.

[2]  David R. Karger,et al.  Approximating s – t Minimum Cuts in ~ O(n 2 ) Time , 2007 .

[3]  Satish Rao,et al.  Expander flows, geometric embeddings and graph partitioning , 2004, STOC '04.

[4]  Yanchun Zhang,et al.  Algorithms and Techniques , 2011 .

[5]  Bruce M. Maggs,et al.  Simultaneous source location , 2009, TALG.

[6]  Frank Thomson Leighton,et al.  Extensions and limits to vertex sparsification , 2010, STOC '10.

[7]  Vahab S. Mirrokni,et al.  Advantage of Overlapping Clusters for Minimizing Conductance , 2012, LATIN.

[8]  Robert Krauthgamer,et al.  Min-max Graph Partitioning and Small Set Expansion , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

[9]  Frank Thomson Leighton,et al.  Vertex Sparsifiers and Abstract Rounding Algorithms , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.

[10]  Ojas Parekh,et al.  A Unified Approach to Approximating Partial Covering Problems , 2006, Algorithmica.

[11]  Robert Krauthgamer,et al.  Vertex Sparsifiers: New Results from Old Techniques , 2010, APPROX-RANDOM.

[12]  Ankur Moitra,et al.  Approximation Algorithms for Multicommodity-Type Problems with Guarantees Independent of the Graph Size , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

[13]  Sanjeev Khanna,et al.  Multicommodity flow, well-linked terminals, and routing problems , 2005, STOC '05.

[14]  Sanjeev Khanna,et al.  The all-or-nothing multicommodity flow problem , 2004, STOC '04.

[15]  Julia Chuzhoy.  On vertex sparsifiers with Steiner nodes , 2012, STOC '12.

[16]  Harald Räcke,et al.  Optimal hierarchical decompositions for congestion minimization in networks , 2008, STOC.

[17]  David Fernández-Baca.  LATIN 2012: Theoretical Informatics , 2012, Lecture Notes in Computer Science.

[18]  Joseph Naor,et al.  Cut problems in graphs with a budget constraint , 2007, J. Discrete Algorithms.

[19]  Satish Rao,et al.  A polynomial-time tree decomposition to minimize congestion , 2003, SPAA '03.

[20]  Konstantin Makarychev,et al.  Metric extension operators, vertex sparsifiers and Lipschitz extendability , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.