Sanjeev Arora
Satish Rao
Umesh Vazirani
ABSTRACT
We give a O(√log n)-approximation algorithm for sparsest cut, balanced separator, and graph conductance problems. This improves the O(log n)-approximation of Leighton and Rao (1988). We use a well-known semidefinite relaxation with triangle inequality constraints. Central to our analysis is a geometric theorem about projections of point sets in Rd, whose proof makes essential use of a phenomenon called measure concentration. We also describe an interesting and natural "certificate" for a graph's expansion, by embedding an n-node expander in it with appropriate dilation and congestion. We call this an expander flow.
- F. Alizadeh. Interior point methods in semidefinite programming with applications to combinatorial optimization. SIAM J. Optimization, 5:13--51, 1995.Google Scholar
Cross Ref
- N. Alon. Eigenvalues and expanders. Combinatorica 6:83--96, 1986. Google ScholarDigital Library
- N. Alon and V. Milman. λ1, isoperimetric inequalities for graphs and superconcentrators. J. Combin. Theory B 38:73--88, 1985.Google ScholarCross Ref
- Y. Aumann and Y. Rabani. An O(log k) approximate min-cut max-flow theorem and approximation algorithms. SIAM J. Comp Google ScholarDigital Library
- K. Ball. An elementary introduction to modern convex geometry, in Flavors of Geometry, S. Levy (ed. ), Cambridge University Press, 1997.Google Scholar
- M. Blum, R. Karp, O. Vornberger, C. Papadimitriou, M. Yannakakis. The complexity of testing whether a graph is a superconcentrator. Inf. Proc. Letters 13:164--167, 1981.Google ScholarCross Ref
- J. Bourgain. On Lipschitz embeddings of finite metric spaces in Hilbert space. Israel J. Mathematics 52:46--52, 1985.Google ScholarCross Ref
- J. Cheeger. A lower bound for the smallest eigenvalue of the Laplacian, in Problem in Analysis, 195-199, Princeton Univ. Press, (1970),Google Scholar
- F. Chen, L. Lovasz and I. Pak. Lifting Markov Chains to Speed up Mixing. Proc. ACM STOC, 1999, pp 275--281. Google ScholarDigital Library
- F. Chung. Spectral graph theory. CBMS Regional Conference Series in Mathematics, 92, American Mathematical Society, 1997.Google Scholar
- L. Danzer and B. Grunbaum. On two problems of P. Erdos and V. L. Klee concerning convex bodies (in German). Math. Zeitschrift 79:95--99, 1962.Google ScholarCross Ref
- P. Diaconis and L. Saloff-Coste. Comparison theorems for reversible Markov chains. Annals of Applied Probability, 3:696--730, 1993.Google ScholarCross Ref
- U. Feige and R. Krauthgamer. A polylogarithmic approximation of the minimum bisection. In IEEE FOCS 2001 pp 105--115. Google ScholarDigital Library
- N. Garg and J. Koneman. Faster and Simpler Algorithms for Multicommodity Flow and other Fractional Packing Problems. In IEEE FOCS 1997. Google ScholarDigital Library
- N. Garg and V. V. Vazirani and M. Yannakakis. Approximate max-flow min-(multi)cut theorems and their applications. SIAM J. Computing, 25(2):235--251, 1996. Prelim. version in Proc. ACM STOC'93. Google ScholarDigital Library
- M. X. Goemans. Semidefinite programming in combinatorial optimization. Math. Programming, 79:143--161, 1997. Google ScholarDigital Library
- M. X. Goemans. unpublished note.Google Scholar
- M. X. Goemans and D. P. Williamson. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. JACM, 42(6):1115--1145, 1995. Google ScholarDigital Library
- M. Grotschel, L. Lovasz, and A. Schrijver. Geometric algorithms and combinatorial optimization. Springer-Verlag, 1993.Google ScholarCross Ref
- H. Karloff and U. Zwick. A 7/8-approximation algorithm for MAX 3SAT? Proc. of 38th IEEE FOCS (1997), 406-415. Google ScholarDigital Library
- D. Karger, R. Motwani, and M. Sudan. Approximate graph coloring by semidefinite programming. JACM, 45(2):246--265, 1998. Google ScholarDigital Library
- M. Jerrum and A. Sinclair. Approximating the permanent. SIAM J. Comput., 18(6):1149-1178, 1989. Google ScholarDigital Library
- T. Leighton and S. Rao. Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. JACM 46 1999. Prelim. version in ACM STOC 1988. Google ScholarDigital Library
- N. Linial, E. London, and Y. Rabinovich. The geometry of graphs and some of its algorithmic applications. Combinatorica 15:215--246, 1995.Google ScholarCross Ref
- L. Lovasz. On the Shannon capacity of a graph. IEEE Trans. on Info. Theory IT-25:1--7, 1979.Google ScholarDigital Library
- A. Lubotzky, R. Philips, and P. Sarnak. Ramanujan graphs. Combinatorica, 8:261--277, 1988.Google ScholarCross Ref
- J. Matousek. Lectures on Discrete Geometry. Springer Verlag, 2002. Google ScholarDigital Library
- Y. Nesterov and A. Nemirovskii. Interior point polynomial methods in convex programming. SIAM, Philadelphia, PA 1994.Google Scholar
- S. Plotkin and D. B. Shmoys and E. Tardos. Fast approximation algorithms for fractional packing and covering problems. Math. Operations Res. 20:257--301, 1995. Prelim. version IEEE Foundations of Computer Science, 1991, 495--504. Google ScholarDigital Library
- G. Schechtman. Concentration, results and applications. Handbook of the Geometry of Banach Spaces, volume 2, W. B. Johnson and J. Lindenstrauss (eds. ), North Holland, 2003. Draft version available from Schechtman's website.Google ScholarCross Ref
- F. Shahrokhi and D. W. Matula. The maximum concurrent flow problem. Journal of the ACM, 37:318--334, 1990. Google ScholarDigital Library
- D. S. Shmoys. Cut problems and their application to divide and conquer. Approximation Algorithms for NP-hard problems, D. S. Hochbaum (ed. ), PWS Publishing, 1995. Google ScholarDigital Library
- A. Sinclair. Improved bounds for mixing rates of Markov chains and multicommodity flow. Combinatorics, Prob., Comput. 1:351--370, 1992.Google Scholar
- V. Vazirani. Approximation algorithms. Springer Verlag, 2002. Google ScholarDigital Library
- K. Zatloukal. Personal communication, November 2003.Google Scholar
Index Terms
- Expander flows, geometric embeddings and graph partitioning
Recommendations
Expander flows, geometric embeddings and graph partitioning
We give a O(√log n)-approximation algorithm for the sparsest cut, edge expansion, balanced separator, and graph conductance problems. This improves the O(log n)-approximation of Leighton and Rao (1988). We use a well-known semidefinite relaxation with ...
An Expander-Based Approach to Geometric Optimization
We present a new approach to problems in geometric optimization that are traditionally solved using the parametric-searching technique of Megiddo [J. ACM, 30 (1983), pp. 852--865]. Our new approach is based on expander graphs and range-searching ...
Splitting an Expander Graph
Let G=(V,E) be an r-regular expander graph. Certain algorithms for finding edge disjoint paths require that its edges be partitioned into E=E1 E2 Ek so that the graphs Gi=(V,Ei) are each expanders. In this paper we give a nonconstructive proof of the ...
Comments