Back to Search
Start Over
Improved approximations for max set splitting and max NAE SAT
- Source :
-
Discrete Applied Mathematics . Aug2004, Vol. 142 Issue 1-3, p133-149. 17p. - Publication Year :
- 2004
-
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). [Copyright &y& Elsevier]
- Subjects :
- *ALGORITHMS
*APPROXIMATION theory
*MATHEMATICAL programming
*MATHEMATICAL analysis
Subjects
Details
- Language :
- English
- ISSN :
- 0166218X
- Volume :
- 142
- Issue :
- 1-3
- Database :
- Academic Search Index
- Journal :
- Discrete Applied Mathematics
- Publication Type :
- Academic Journal
- Accession number :
- 13806112
- Full Text :
- https://doi.org/10.1016/j.dam.2002.07.001