Title of article
Improved approximations for max set splitting and max NAE SAT Original Research Article
Author/Authors
Jiawei Zhang، نويسنده , , Yinyu Ye، نويسنده , , Qiaoming Han، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2004
Pages
17
From page
133
To page
149
Abstract
We present a 0.7499-approximation algorithm for Max Set Splitting in this paper. The previously best known result for this problem is a 0.7240-approximation by Andersson and Engebretsen (Inform. Process. Lett. 65 (1998) 305), which is based on a semidefinite programming (SDP) relaxation. Our improvement is resulted from a strengthened SDP relaxation, an improved rounding method, and a tighter analysis compared with that in Andersson and Engebretsen (1998).
Keywords
Max NAE SAT , Approximation algorithm , Max-Set-Splitting , Semidefinite programming relaxation
Journal title
Discrete Applied Mathematics
Serial Year
2004
Journal title
Discrete Applied Mathematics
Record number
885910
Link To Document