Outward rotations
- 1 May 1999
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 679-687
- https://doi.org/10.1145/301250.301431
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- Better approximation algorithms for Set Splitting and Not-All-Equal SatInformation Processing Letters, 1998
- Semidefinite relaxation and nonconvex quadratic optimizationOptimization Methods and Software, 1998
- Finding almost-satisfying assignmentsPublished by Association for Computing Machinery (ACM) ,1998
- Some optimal inapproximability resultsPublished by Association for Computing Machinery (ACM) ,1997
- Approximability of maximum splitting of k-sets and some other Apx-complete problemsInformation Processing Letters, 1996
- How good is the Goemans-Williamson MAX CUT algorithm?Published by Association for Computing Machinery (ACM) ,1996
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programmingJournal of the ACM, 1995
- On the Approximation of Maximum SatisfiabilityJournal of Algorithms, 1994