TY - JOUR
T1 - Approximating maximum satisfiable subsystems of linear equations of bounded width
AU - Nutov, Zeev
AU - Reichman, Daniel
PY - 2008/5/31
Y1 - 2008/5/31
N2 - We consider the problem known as MAX - SATISFY: given a system of m linear equations over the rationals, find a maximum set of equations that can be satisfied. Let r be the width of the system, that is, the maximum number of variables in an equation. We give an Ω (m- 1 + 1 / r)-approximation algorithm for any fixed r. Previously the best approximation ratio for this problem was Ω ((log m) / m) even for r = 2. In addition, we slightly improve the hardness results for MAX - SATISFY.
AB - We consider the problem known as MAX - SATISFY: given a system of m linear equations over the rationals, find a maximum set of equations that can be satisfied. Let r be the width of the system, that is, the maximum number of variables in an equation. We give an Ω (m- 1 + 1 / r)-approximation algorithm for any fixed r. Previously the best approximation ratio for this problem was Ω ((log m) / m) even for r = 2. In addition, we slightly improve the hardness results for MAX - SATISFY.
KW - Approximation algorithms
KW - Linear equations
KW - Satisfiable systems
UR - http://www.scopus.com/inward/record.url?scp=41549163566&partnerID=8YFLogxK
U2 - 10.1016/j.ipl.2007.11.011
DO - 10.1016/j.ipl.2007.11.011
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:41549163566
SN - 0020-0190
VL - 106
SP - 203
EP - 207
JO - Information Processing Letters
JF - Information Processing Letters
IS - 5
ER -