Summary: Random Sampling and Approximation of MAX-CSP Problems
Noga Alon
Department of Mathematics
Tel Aviv University
Tel Aviv
W. Fernandez de la Vega
CNRS
Universite Paris Sud
Orsay
Ravi Kannan
Department of Computer Science
Yale University
Marek Karpinski
Department of Computer Science
University of Bonn §
Abstract
We present a new efficient sampling method for approximat-
ing r-dimensional Maximum Constraint Satisfaction Prob-
lems, MAX-rCSP, on n variables up to an additive error nr
.

Source: Alon, Noga - School of Mathematical Sciences, Tel Aviv University

Collections: Mathematics