Sampling sub-problems of heterogeneous max-cut problems and approximation algorithms

Lecture Notes in Computer Science

Volumn 3404, Issue , 2005, Pages 57-68

  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

[No Author keywords available]

Indexed keywords

ALGORITHMS; DECOMPOSITION; LINEAR PROGRAMMING; OPTIMIZATION; PROBLEM SOLVING;

NONUNIFORM SAMPLING; OPTIMIZATION PROBLEMS; RANDOMIZED APPROXIMATION;

APPROXIMATION THEORY;

EID: 24144443171     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-31856-9_5     Document Type: Conference Paper

References (23)

1. N. Alon, W.F. de la Vega, R. Kannan, and M. Karpinski. Random sampling and approximation of MAX-CSP problems. In Proceedings of the 34th Annual ACM Symposium on Theory of Computing, pages 232-239, 2002.
2. N. Alon, W.F. de la Vega, R. Kannan, and M. Karpinski. Random sampling and approximation of MAX-CSPs. Journal of Computer and System Sciences, 67:212-243, 2003.
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, pages 284-293, 1995.
4. Z. Bar-Yossef. The Complexity of Massive Data Set Computations. PhD thesis, University of California, Berkeley, 2002.
5. Z. Bar-Yossef. Sampling lower bounds via information theory. In Proceedings of the 35th Annual ACM Symposium on Theory of Computing, pages 335-344, 2003.
6. W.F. de la Vega. MAX-CUT has a randomized approximation scheme in dense graphs. Random Structures and Algorithms, 8(3):187-198, 1996.
7. 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.
8. 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, pages 291-299, 1999.
9. 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, pages 452-459, 2001.
10. P. Drineas and R. Kannan. Pass efficient algorithms for approximating large matrices. In Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 223-232, 2003.
11. P. Drineas, R. Kannan, and M.W. Mahoney. Sampling sub-problems of heterogeneous MAX-2-CSP problems and approximation algorithms, manuscript.
12. P. Drineas, R. Kannan, and M.W. Mahoney. Fast Monte Carlo algorithms for matrices I: Approximating matrix multiplication. Technical Report YALEU/DCS/TR-1269, Yale University Department of Computer Science, New Haven, CT, February 2004.
13. P. Drineas, R. Kannan, and M.W. Mahoney. Fast Monte Carlo algorithms for matrices II: Computing a low-rank approximation to a matrix. Technical Report YALEU/DCS/TR-1270, Yale University Department of Computer Science, New Haven, CT, February 2004.
14. P. Drineas, R. Kannan, and M.W. Mahoney. Fast Monte Carlo algorithms for matrices III: Computing a compressed approximate matrix decomposition. Technical Report YALEU/DCS/TR-1271, Yale University Department of Computer Science, New Haven, CT, February 2004.
15. P. Drineas, R. Kannan, and M.W. Mahoney. Sampling sub-problems of heterogeneous Max-Cut problems and approximation algorithms. Technical Report YALEU/DCS/TR-1283, Yale University Department of Computer Science, New Haven, CT, April 2004.
16. 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, pages 12-20, 1996.
17. A. Frieze and R. Kannan. Quick approximation to matrices and applications. Combinatorica, 19(2): 175-220, 1999.
18. 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, pages 339-348, 1996.
19. G.H. Golub and C.F. Van Loan. Matrix Computations. Johns Hopkins University Press, Baltimore, 1989.
20. R.A. Horn and C.R. Johnson. Matrix Analysis. Cambridge University Press, New York, 1985.
21. J.S. Liu. Monte Carlo Strategies in Scientific Computing. Springer-Verlag, New York, 2001.
22. M.E.J. Newman. The structure and function of complex networks. SIAM Review, 45(2):167-256, 2003.
23. G.W. Stewart and J.G. Sun. Matrix Perturbation Theory. Academic Press, New York, 1990.