On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem
Authors:
- 1 January 2010
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 223-236
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- On the maximum satisfiability of random formulasJournal of the ACM, 2007
- Threshold values of random K‐SAT from the cavity methodRandom Structures & Algorithms, 2005
- The probabilistic analysis of a greedy satisfiability algorithmRandom Structures & Algorithms, 2005
- Rigorous location of phase transitions in hard optimization problemsNature, 2005
- sub-SAT2002
- Improved Approximation Algorithms for MAX SATJournal of Algorithms, 2002
- Some optimal inapproximability resultsJournal of the ACM, 2001
- On Syntactic versus Computational Views of ApproximabilitySIAM Journal on Computing, 1998
- Algorithms for the maximum satisfiability problemComputing, 1990
- Approximation algorithms for combinatorial problems1973