@article{oai:nagoya.repo.nii.ac.jp:00013173,
 author = {HIRATA, Tomio and ONO, Takao},
 issue = {3},
 journal = {IEICE transactions on information and systems},
 month = {Mar},
 note = {Maximum Satisfiability Problem (MAX SAT) is one of the most natural optimization problems. Since it is known to be NP-hard, approximation algorithms have been considered. The aim of this survey is to show recent developments of approximation algorithms for MAX SAT.},
 pages = {488--495},
 title = {Approximation Algorithms for MAX SAT},
 volume = {E83-D},
 year = {2000}
}