Sampling subproblems of heterogeneous max-cut problems and approximation algorithms

Random Structures and Algorithms

Volumn 32, Issue 3, 2008, Pages 307-333

  Drineas, Petros ^a   Kannan, Ravi ^b   Mahoney, Michael W ^c  

^a Rensselaer Polytechnic Institute   (United States)

^b Yale University   (United States)

^c YALE UNIVERSITY   (United States)

Author keywords

CUR matrix decomposition; Max cut algorithm; Sampling linear programs

Indexed keywords

EID: 52349107576     PISSN: 10429832     EISSN: 10982418     Source Type: Journal    
DOI: 10.1002/rsa.20196     Document Type: Article

References (36)

1. N. Alon, W. F. de la Vega, R. Kannan, and M. Karpinski, Random sampling and approximation of MAX-CSPs, J Comput Syst Sci 67 (2003), 212-243.
2. N. Alon and A. Naor, Approximating the cut-norm via Grothendieck's inequality, SIAM J Comput 35 (2006), 787-803.
3. S. Arora, D. Karger, and M. Karpinski, Polynomial time approximation schemes for dense instances of NP-hard problems, In Proceedings of the 27th Annual ACM Symposium on Theory of Computing, 1995, pp. 284-293.
4. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy, Proof verification and the hardness of approximation problems, In Proceedings of the 33rd Annual IEEE Symposium on Foundations of Computer Science, 1992, pp. 14-23.
5. Z. Bar-Yossef, The complexity of massive data set computations, PhD thesis, University of California, Berkeley, 2002.
6. Z. Bar-Yossef, Sampling lower bounds via information theory, In Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003, pp. 335-344.
7. F. Barahona, M. Grötschel, M. Jünger, and G. Reinelt, An application of combinatorial optimization to statistical physics and circuit layout design, Oper Res 36 (1988), 493-513.
8. W. F. de la Vega, MAX-CUT has a randomized approximation scheme in dense graphs, Random Struct Algorithms 8 (1996), 187-198.
9. W. F. de la Vega and M. Karpinski, A polynomial time approximation scheme for subdense MAX-CUT, Technical Report TR02-044, Electronic Colloquium on Computational Complexity, 2002.
10. P. Drineas, A. Frieze, R. Kannan, S. Vempala, and V. Vinay, Clustering in large graphs and matrices, In Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, 1999, pp. 291-299.
11. P. Drineas and R. Kannan, Fast Monte-Carlo algorithms for approximate matrix multiplication, In Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science, 2001, pp. 452-459.
12. P. Drineas and R. Kannan, Pass efficient algorithms for approximating large matrices, In Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, 2003, pp. 223-232.
13. P. Drineas, R. Kannan, and M. W. Mahoney, Sampling sub-problems of heterogeneous Max-Cut problems and approximation algorithms, In Proceedings of the 22nd Annual International Symposium on Theoretical Aspects of Computer Science, 2005, pp. 57-68.
14. P. Drineas, R. Kannan, and M. W. Mahoney, Fast Monte Carlo algorithms for matrices. I. Approximating matrix multiplication, SIAM J Comput 36 (2006), 132-157.
15. P. Drineas, R. Kannan, and M. W. Mahoney, Fast Monte Carlo algorithms for matrices. II. Computing a low-rank approximation to a matrix, SIAM J Comput 36 (2006), 158-183.
16. P. Drineas, R. Kannan, and M. W. Mahoney, Fast Monte Carlo algorithms for matrices. III. Computing a compressed approximate matrix decomposition, SIAM J Comput 36 (2006), 184-206.
17. A. Frieze and R. Kannan, The regularity lemma and approximation schemes for dense problems, In Proceedings of the 37th Annual IEEE Symposium on Foundations of Computer Science, 1996, pp. 12-20.
18. A. Frieze and R. Kannan, Quick approximation to matrices and applications, Combinatorica 19 (1999), 175-220.
19. A. Frieze, R. Kannan, and S. Vempala, Fast Monte-Carlo algorithms for finding low-rank approximations, In Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science, 1998, pp. 370-378.
20. M. X. Goemans and D. P. Williamson, .878-approximation algorithms for MAX CUT and MAX 2SAT, In Proceedings of the 26th Annual ACM Symposium on Theory of Computing, 1994, pp. 422-431.
21. O. Goldreich, S. Goldwasser, and D. Ron, Property testing and its connection to learning and approximation, In Proceedings of the 37th Annual IEEE Symposium on Foundations of Computer Science, 1996, pp. 339-348.
22. G. H. Golub and C. F. Van Loan, Matrix computations, Johns Hopkins University Press, Baltimore, 1989.
23. J. Håstad, Some optimal inapproximability results, J ACM 48 (2001), 798-859.
24. R. A. Horn and C. R. Johnson, Matrix analysis, Cambridge University Press, New York, 1985.
25. S. Khanna, M. Sudan, L. Trevisan, and D. P. Williamson, The approximability of constraint satisfaction problems, SIAM J Comput 30 (2001), 1863-1920.
26. S. Khot, On the power of unique 2-prover 1-round games, In Proceedings of the 34th Annual ACM Symposium on Theory of Computing, 2002, pp. 767-775.
27. S. Khot, G. Kindler, E. Mossel, and R. O'Donnell, Optimal inapproximability results for Max-Cut and other 2-variable CSPs? In Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science, 2004, pp. 146-154.
28. R. Kumar and R. Rubinfeld, Sublinear time algorithms, Samir Khuller's Algorithms column in SIGACT News 2003.
29. J. S. Liu, Monte Carlo strategies in scientific computing, Springer-Verlag, New York, 2001.
30. M. E. J. Newman, The structure and function of complex networks, SIAM Rev 45 (2003), 167-256.
31. S. Poljak and Z. Tuza, "Maximum cuts and large bipartite subgraphs," In Combinatorial optimization, DIMACS series in discrete mathematics and theoretical computer Science, Vol. 20, W. Cook, L. Lovász, P. Seymour (Editors), American Mathematical Society, 1995, pp. 181-244.
32. J. Renegar, Some perturbation theory for linear programming, Math Program 65 (1994), 73-91.
33. J. Renegar, Incorporating condition measures into the complexity theory of linear programming, SIAM J Optimization 5 (1995), 506-524.
34. A. Schrijver, Theory of linear and integer programming, Wiley, New York, 1998.
35. D. Spielman and S. H. Teng, Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time, In Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, 2001, pp. 296-305.
36. G. W. Stewart and J. G. Sun, Matrix perturbation theory, Academic Press, New York, 1990.