Approximation algorithms for constraint satisfaction problems involving at most three variables per constraint

Research output: Contribution to conferencePaperpeer-review

Abstract

An instance of MAX 3CSP is a collection of m clauses of the form fi(zi1, zi2, zi3), where the zij's are literals or constants, from the set {0, 1, x1, ..., xn, x̄1, ..., x̄n}, and the fi's are arbitrary Boolean functions depending on three variables. Each clause has a non-negative weight wi associated with it. A solution to the instance is an assignment of 0-1 values to the variables x1, ..., xn that maximizes ∑i = 1n wifi(zi1, zi2, zi3), the total weight of the satisfied clauses.

Original languageEnglish
Pages201-210
Number of pages10
StatePublished - 1998
EventProceedings of the 1998 9th Annual ACM SIAM Symposium on Discrete Algorithms - San Francisco, CA, USA
Duration: 25 Jan 199827 Jan 1998

Conference

ConferenceProceedings of the 1998 9th Annual ACM SIAM Symposium on Discrete Algorithms
CitySan Francisco, CA, USA
Period25/01/9827/01/98

Fingerprint

Dive into the research topics of 'Approximation algorithms for constraint satisfaction problems involving at most three variables per constraint'. Together they form a unique fingerprint.

Cite this