Vertex Sparsifiers: New Results from Old Techniques

  • Matthias Englert
  • Anupam Gupta
  • Robert Krauthgamer
  • Harald Räcke
  • Inbal Talgam-Cohen
  • Kunal Talwar
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6302)

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 [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 of \({\smash{O(\frac{\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(logk). (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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [AF09]
    Andersen, R., Feige, U.: Interchanging distance and capacity in probabilistic mappings. CoRR, abs/0907.3631 (2009)Google Scholar
  2. [AFH+04]
    Archer, A., Fakcharoenphol, J., Harrelson, C., Krauthgamer, R., Talwar, K., Tardos, É.: Approximate classification via earthmover metrics. In: Proc. 15th SODA, pp. 1079–1087 (2004)Google Scholar
  3. [CKR04]
    Calinescu, G., Karloff, H.J., Rabani, Y.: Approximation algorithms for the 0-extension problem. SIAM J. Comput. 34(2), 358–372 (2004)MATHCrossRefMathSciNetGoogle Scholar
  4. [FHRT03]
    Fakcharoenphol, J., Harrelson, C., Rao, S., Talwar, K.: An improved approximation algorithm for the 0-extension problem. In: Proc. 14th SODA, pp. 257–265 (2003)Google Scholar
  5. [FRT04]
    Fakcharoenphol, J., Rao, S., Talwar, K.: A tight bound on approximating arbitrary metrics by tree metrics. J. Comput. System Sci. 69(3), 485–497 (2004)MATHCrossRefMathSciNetGoogle Scholar
  6. [FT03]
    Fakcharoenphol, J., Talwar, K.: Improved decompositions of graphs with forbidden minors. In: Arora, S., Jansen, K., Rolim, J.D.P., Sahai, A. (eds.) 6th APPROX. LNCS, vol. 2764, pp. 36–46. Springer, Heidelberg (2003)Google Scholar
  7. [GNR10]
    Gupta, A., Nagarajan, V., Ravi, R.: Improved approximation algorithms for requirement cut. Operations Research Letters 38(4), 322–325 (2010)CrossRefGoogle Scholar
  8. [GNRS04]
    Gupta, A., Newman, I., Rabinovich, Y., Sinclair, A.: Cuts, trees and ℓ1-embeddings of graphs. Combinatorica 24(2), 233–269 (2004)MATHCrossRefMathSciNetGoogle Scholar
  9. [Gup01]
    Gupta, A.: Steiner points in tree metrics don’t (really) help. In: Proc. 12th SODA, pp. 220–227 (2001)Google Scholar
  10. [KPR93]
    Klein, P., Plotkin, S.A., Rao, S.B.: Excluded minors, network decomposition, and multicommodity flow. In: Proc. 25th STOC, pp. 682–690 (1993)Google Scholar
  11. [LM10]
    Leighton, T., Moitra, A.: Extensions and limits to vertex sparsification. In: Proc. 42th STOC, pp. 47–56 (2010)Google Scholar
  12. [LN05]
    Lee, J.R., Naor, A.: Extending Lipschitz functions via random metric partitions. Invent. Math. 160(1), 59–95 (2005)MATHCrossRefMathSciNetGoogle Scholar
  13. [LS09]
    Lee, J.R., Sidiropoulos, A.: On the geometry of graphs with a forbidden minor. In: Proc. 41st STOC, pp. 245–254 (2009)Google Scholar
  14. [Moi09]
    Moitra, A.: Approximation algorithms for multicommodity-type problems with guarantees independent of the graph size. In: Proc. 50th FOCS, pp. 3–12 (2009)Google Scholar
  15. [NL09]
    Nowozin, S., Lampert, C.H.: Global connectivity potentials for random field models. In: Proc. 22nd CVPR, pp. 818–825 (2009)Google Scholar
  16. [Räc08]
    Räcke, H.: Optimal hierarchical decompositions for congestion minimization in net works. In: Proc. 40th STOC, pp. 255–264 (2008)Google Scholar
  17. [VKR08]
    Vicente, S., Kolmogorov, V., Rother, C.: Graph cut based image segmentation with connectivity priors. In: Proc. 21st CVPR (2008)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Matthias Englert
    • 1
  • Anupam Gupta
    • 2
  • Robert Krauthgamer
    • 3
  • Harald Räcke
    • 1
  • Inbal Talgam-Cohen
    • 3
  • Kunal Talwar
    • 4
  1. 1.Department of Computer Science and DIMAPUniversity of WarwickCoventryUK
  2. 2.Computer Science DepartmentCarnegie Mellon UniversityPittsburghUSA
  3. 3.Weizmann Institute of ScienceRehovotIsrael
  4. 4.Microsoft Research Silicon ValleyMountain ViewUSA

Personalised recommendations