Random sampling and approximation of MAX-CSPs

Journal of Computer and System Sciences

Volumn 67, Issue 2, 2003, Pages 212-243

  Alon, Noga ^a   De La Vega, W Fernandez ^b   Kannan, Ravi ^c   Karpinski, Marek ^d  

^a TEL AVIV UNIVERSITY   (Israel)

^b CNRS   (France)

^c Yale University   (United States)

^d UNIVERSITY OF BONN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BOOLEAN FUNCTIONS; COMPUTATIONAL COMPLEXITY; ERRORS; POLYNOMIALS; PROBABILITY; RANDOM PROCESSES; SAMPLING; THEOREM PROVING;

MAXIMUM CONSTRAINT SATISFACTION PROBLEM; RANDOM SAMPLING; TRUTH ASSIGNMENT;

OPTIMIZATION;

EID: 0142123181     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0022-0000(03)00008-4     Document Type: Article

References (16)

1. N. Alon, B. Doerr, T. Luczak, T. Schoen, On the discrepancy of combinatorial rectangles, Random Structures Algorithms 21 (2002) 205-215.
2. N. Alon, W. Fernandez-de-la-Vega, R. Kannan, M. Karpinski, Random sampling and approximation of MAX-CSP problems, in: Proceedings of the 34th ACM STOC, ACM, New York, 2002, pp. 232-239.
3. N. Alon, A. Shapira, Testing satisfiability, in: Proceedings of the 13th Annual ACM-SIAM SODA, ACM, New York, 2002, pp. 645-654.
4. G. Andersson, L. Engebretsen, Sampling methods applied to dense instances of non-Boolean optimization problems, in: Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science, Barcelona, October 1998, LNCS, Vol. 1017, Springer, Berlin, 1998, pp. 357-368.
5. G. Andersson, L. Engebretsen, Property testers for dense constraint satisfaction programs on finite domains, Random Structures Algorithms 21 (2002) 14-32.
6. S. Arora, D. Karger, M. Karpinski, Polynomial time approximation schemes for dense instances of NP-hard problems, Proceedings of the 27th Annual ACM Symposium on Theory of Computing, Las Vegas, 1995, pp. 284-293; the full paper appeared in J. Comput. System Sci. 58 (1999) 193-210.
7. A. Czumaj, C. Sohler, Testing hypergraph coloring, in: Proceedings of the 28th ICALP'01, LNCS, Vol. 2076, Springer, Berlin, 2001, pp. 493-505.
8. W. Fernandez-de-la-Vega, MAX-CUT has a randomized approximation scheme in dense graphs, Random Structures Algorithms 8 (1996) 187-199.
9. A. M. Frieze, R. Kannan, The Regularity Lemma and approximation schemes for dense problems, Proceedings of the 37th Annual IEEE Symposium on Foundations of Computing, Burlington, Vermont, 1996, pp. 12-20.
10. A. M. Frieze, R. Kannan, Quick approximation to matrices and applications, Combinatorica 19 (2) (1999) 175-200.
11. M.X. Goemans, D.P. Williamson, 878-Approximation algorithms for MAX CUT and MAX 2SAT, in: Proceedings of the 26th Annual ACM Symposium on Theory of Computing, ACM, New York, 1994, pp. 422-431.
12. O. Goldreich, S. Goldwasser, D. Ron, Property testing and its connection to learning and approximation, Proceedings of the 37th IEEE FOCS 96, Burlington, Vermont, pp. 339-348; the full paper appeared in J. Amer. Comput. Mach. 45 (1998) 653-750.
13. W. Hoeffding, Probability inequalities for sums of bounded random variables, J. Amer. Statis. Assoc. 58 (1963) 13-30.
14. F.J. MacWilliams, N.J.A. Sloane, The Theory of Error-Correcting Codes, North-Holland, Amsterdam, 1977.
15. S.J. Szarek, On the best constants in the Khinchin Inequality, Studia Math. 58 (1976) 197-208.
16. V.N. Vapnik, A.Y. Chervonenkis, On the uniform convergence of relative frequencies of events to their probabilities, Theory Probab. Appl. 16 (2) (1971) 264-280.