Approximation Algorithms for Constraint Satisfaction Problems Involving at Most Three Variables per Constraint

@inproceedings{Zwick1998ApproximationAF,
  title={Approximation Algorithms for Constraint Satisfaction Problems Involving at Most Three Variables per Constraint},
  author={Uri Zwick},
  booktitle={SODA},
  year={1998}
}
An instance of MAX 3CSP is a collection of m clauses of the form fi(.zil, .Q, zis), where the Zij’s are literals, or constants, from the set (0, 1, ti, . . . , zn, Ii,. . . , &}, and the fi’s are arbitrary Boolean functions depending on (at most) three variables. Each clause has a nonnegative weight wi associated with it. A solution to the instance is an assignment of O-l values to the variables Zl,..., C, that maximizes X:=1 wi fi(Zil, zi2, YQ), the total weight of the satisfied clauses. The… CONTINUE READING
Highly Influential
This paper has highly influenced 16 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 150 citations. REVIEW CITATIONS
101 Citations
0 References
Similar Papers

Citations

Publications citing this paper.

151 Citations

01020'97'02'08'14
Citations per Year
Semantic Scholar estimates that this publication has 151 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…