Improved approximations for max set splitting and max NAE SAT☆
Under an Elsevier user license
open archive
Keywords
Max-Set-Splitting
Max NAE SAT
Approximation algorithm
Semidefinite programming relaxation
Cited by (0)
- ☆
This research was supported in part by NSF grants DMI-9908077 and DMS-9703490.
- 1
This work was done while the author was visiting Fudan University, Shanghai, PR China.
- 2
This work was done while the author was visiting Computational Optimization Laboratory, Department of Management Sciences, University of Iowa. The author is supported by in part by NSFC grants 10226017 and 10201011.
Copyright © 2004 Elsevier B.V. All rights reserved.