Random sampling and approximation of MAX-CSP problems

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2002, Pages 232-239

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

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BOOLEAN FUNCTIONS; COMPUTATIONAL COMPLEXITY; LINEAR PROGRAMMING; RANDOM PROCESSES; SET THEORY; THEOREM PROVING;

MAXIMUM CONSTRAINT SATISFACTION PROBLEM; RANDOM SAMPLING;

OPTIMIZATION;

EID: 0036041771     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/509943.509945     Document Type: Conference Paper

References (17)

1. On the discrepancy of combinatorial rectangles
2. Testing satisfiability
3. Polynomial time approximation schemes for dense instances of NP-hard problems
4. Weighted sum of certain dependent random variables
5. Testing hypergraph coloring
6. MAX-CUT has a randomized approximation scheme in dense graphs
7. The regularity lemma and approximation schemes for dense problems
8. Quick approximation to matrices and applications
9. 878-approximation algorithms for MAX CUT and MAX 2SAT
10. Property testing and its connection to learning and approximation
11. Probability inequalities for sums of bounded random variables
12. A complete classification of the approximability of maximization problems derived from boolean constraint satisfaction
13. The theory of error-correcting codes
14. On the best constants in the Khinchin inequality
15. On the uniform convergence of relative frequencies of events to their probabilities