Improved approximations for max set splitting and max NAE SAT

17Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

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). © 2004 Elsevier B.V. All rights reserved.

Cite

CITATION STYLE

APA

Zhang, J., Ye, Y., & Han, Q. (2004). Improved approximations for max set splitting and max NAE SAT. Discrete Applied Mathematics, 142(1-3 SPEC. ISS.), 133–149. https://doi.org/10.1016/j.dam.2002.07.001

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free