O(√log n) approximation to SPARSEST CUT in Õ(n 2) time

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2004, Pages 238-247

  Arora, Sanjeev ^a   Hazan, Elad ^a   Kale, Satyen ^a  

^a Princeton University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHM; MULTICOMMODITY FLOWS; PSEUDO-EXPANDER FLOW; SEMI-DEFINITE PROGRAMS;

ALGORITHMS; APPROXIMATION THEORY; LINEAR PROGRAMMING; PACKET NETWORKS; PROBLEM SOLVING; ROUTERS; THEOREM PROVING;

COMPUTATIONAL COMPLEXITY;

EID: 17744380466     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (27)

1. F. Alizadeh. Interior point methods in semidefinite programming with applications to combinatorial optimization. SIAM J. Optimization, 5:13-51, 1995.
2. N. Alon. Eigenvalues and expanders. Combinatorica, 6:83-96, 1986.
3. 1, isoperimetric inequalities for graphs and superconcentrators. J. Combin. Theory B, 38:73-88, 1985.
4. S. Arora, S. Rao and U. Vazirani. Expander flows, geometric embeddings, and graph partitioning. ACM STOC 2004, pp 222-231.
5. Y. Aumann and Y. Rabani. An O(log k) approximate min-cut max-flow theorem and approximation algorithms. SIAM J. Comp., 27(1):291-301, 1998.
6. 2) Time. In Proc. 28th STOC, 47-55, 1996.
7. M. Blum, R. Karp, O. Vornberger, C. Papadimitriou, M. Yannakakis. The complexity of testing whether a graph is a superconcentrator. IPL, 13:164-167, 1981.
8. S. Chawla, A. Gupta, and H. Racke. Embeddings of negative type metrics and improved approximations to sparsest cut. Manuscript, July 2004.
9. J. Cheeger. A lower bound for the smallest eigenvalue of the Laplacian. Problems in Analysis, 195-199, Princeton Univ. Press, 1970.
10. F. Chung. Spectral graph theory. CBMS Regional Conference Series in Mathematics, 92, AMS, 1997.
11. L. Fleischer. Approximating Fractional Multicommodity Flows Independent of the Number of Commodities. SIAM J. Discrete Math., 13(4):505-520, 2000.
12. Y. Freund and R. Schapire. Adaptive game playing using multiplicative weights. Games and Economic Behavior, 29:79-103, 1999.
13. N. Garg and J. Köneman. Faster and Simpler Algorithms for Multicommodity Flow and other Fractional Packing Problems. In Proc. 39th IEEE FOCS, 300-309, 1998.
14. A. Goldberg and R. Tarjan. A new approach to the maximum flow problem. Journal of the ACM, 35:921-940, 1988.
15. M.X. Goemans and D.P. Williamson. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of the ACM, 42(6): 1115-1145, 1995.
16. P. Klein and S. Plotkin and C. Stein and É. Tardos. Faster Approximation Algorithms for the Unit Capacity Concurrent Flow Problem With Applications to Routing and Finding Sparse Cuts. SIAM J. Comp., 23(3):466-487, 1994.
17. P. Klein and H-I. Lu. Efficient approximation algorithms semidefinite programs arising from max-cut and coloring. In Proc. 28th STOC, 338-347, 1996.
18. J. Kuczynski and H. Wozniakowski. Estimating the largest eigenvalue by the power and Lanczos algorithms with a random start. SIAM J. Matrix Anal. Appl., 13(4): 1094-1122, 1992.
19. T. Leighton and S. Rao. Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. Journal of the ACM, 46(6):787-832, 1999. Prelim. version in ACM STOC 1988.
20. T. Leighton and S. Rao. Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. Journal of the ACM, 46(6):787-832, 1999. Prelim. version in ACM STOC 1988.
21. N. Linial, E. London, and Y. Rabinovich. The geometry of graphs and some of its algorithmic applications. Combinatorica, 15:215-246, 1995.
22. 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 FOCS 1991, 495-504.
23. 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 FOCS 1991, 495-504.
24. F. Shahrokhi and D.W. Matula. The maximum concurrent flow problem. Journal of the ACM, 37(2):318-334, 1990.
25. 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.
26. N. Young. Randomized Rounding without Solving the Linear Program. In Proc. 6th SODA, 170-178, 1995.
27. V. Vazirani. Approximation algorithms. Springer Verlag, 2002.