Advertisement

Sparsest Cut

  • Vijay V. Vazirani
Chapter
  • 1.5k Downloads

Abstract

In this chapter we will obtain an approximation algorithm for the sparsest cut problem using an interesting LP-rounding procedure that employs results on low distortion embeddings of metrics in 1 spaces. As mentioned in Chapter 20, we will get as a corollary an approximate max-flow min-cut theorem for the demands version of multicommodity flow. Approximation algorithms for several other important problems will also follow.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Notes

  1. 189.
    T. Leighton and S. Rao. Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. Journal of the ACM, 46: 787–832, 1999. (Cited on p. 196)MathSciNetCrossRefGoogle Scholar
  2. 180.
    P. Klein, S. Rao, A. Agrawal, and R. Ravi. An approximate max-flow min-cut relation for undirected multicommodity flow, with applications. Combinatorica, 15: 187–202, 1995. (Cited on pp. 178, 196)MathSciNetCrossRefGoogle Scholar
  3. 197.
    N. Linial, E. London, and Y. Rabinovich. The geometry of graphs and some of its algorithmic applications. Combinatorica, 15: 215–245, 1995. (Cited on pp. 195, 196, 266)MathSciNetCrossRefGoogle Scholar
  4. 33.
    J. Bourgain. On Lipschitz embedding of finite metric spaces in Hilbert spaces. Israeli J. Math., 52: 46–52, 1985. (Cited on p. 196)MathSciNetCrossRefGoogle Scholar
  5. 17.
    Y. Aumann and Y. Rabani. An O(log k) approximate min-cut max-flow theorem and approximation algorithms. SIAM Journal on Computing, 27: 291–301, 1998. (Cited on p. 196)MathSciNetCrossRefGoogle Scholar
  6. 197.
    N. Linial, E. London, and Y. Rabinovich. The geometry of graphs and some of its algorithmic applications. Combinatorica, 15: 215–245, 1995. (Cited on pp. 195, 196, 266)MathSciNetCrossRefGoogle Scholar
  7. 89.
    U. Feige and R. Krauthgamer. A polylogarithmic approximation of the minimum bisection. In Proc. 41st IEEE Annual Symposium on Foundations of Computer Science, pages 105–115, 2000. (Cited on pp. 196, 336)CrossRefGoogle Scholar
  8. 249.
    A. Sinclair. Improved bounds for mixing rates of Markov chains and multi-commodity flow. Combinatorics, Probability and Computing, 1: 351–370, 1992. (Cited on p. 196)MathSciNetCrossRefGoogle Scholar
  9. 27.
    S.N. Bhatt and F.T. Leighton. A framework for solving VLSI graph layout problems. Journal of Computer and System Sciences, 28: 300–343, 1984. (Cited on p. 196)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Vijay V. Vazirani
    • 1
  1. 1.Georgia Institute of TechnologyCollege of ComputingAtlantaUSA

Personalised recommendations