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

Uri Zwick

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

Uri Zwick^*

^*Corresponding author for this work

School of Computer Science

Research output: Contribution to conference › Paper › peer-review

116 Scopus citations

Abstract

An instance of MAX 3CSP is a collection of m clauses of the form f_i(z_i1, z_i2, z_i3), where the z_ij's are literals or constants, from the set {0, 1, x₁, ..., x_n, x̄₁, ..., x̄_n}, and the f_i's are arbitrary Boolean functions depending on three variables. Each clause has a non-negative weight w_i associated with it. A solution to the instance is an assignment of 0-1 values to the variables x₁, ..., x_n that maximizes ∑_{i = 1}ⁿ w_if_i(z_i1, z_i2, z_i3), the total weight of the satisfied clauses.

Original language	English
Pages	201-210
Number of pages	10
State	Published - 1998
Event	Proceedings of the 1998 9th Annual ACM SIAM Symposium on Discrete Algorithms - San Francisco, CA, USA Duration: 25 Jan 1998 → 27 Jan 1998

Conference

Conference	Proceedings of the 1998 9th Annual ACM SIAM Symposium on Discrete Algorithms
City	San Francisco, CA, USA
Period	25/01/98 → 27/01/98

Cite this

@conference{d0455468edfa42e88af991a88c455ec0,

title = "Approximation algorithms for constraint satisfaction problems involving at most three variables per constraint",

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.",

author = "Uri Zwick",

year = "1998",

language = "אנגלית",

pages = "201--210",

note = "Proceedings of the 1998 9th Annual ACM SIAM Symposium on Discrete Algorithms ; Conference date: 25-01-1998 Through 27-01-1998",

}

TY - CONF

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

AU - Zwick, Uri

PY - 1998

Y1 - 1998

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0032266121&partnerID=8YFLogxK

M3 - ???researchoutput.researchoutputtypes.contributiontoconference.paper???

AN - SCOPUS:0032266121

SP - 201

EP - 210

T2 - Proceedings of the 1998 9th Annual ACM SIAM Symposium on Discrete Algorithms

Y2 - 25 January 1998 through 27 January 1998

ER -

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

Abstract

Conference

Other files and links

Fingerprint

Cite this