2024-03-29T06:07:47Z
https://nagoya.repo.nii.ac.jp/oai
oai:nagoya.repo.nii.ac.jp:00013173
2023-01-16T04:00:16Z
320:321:322
Approximation Algorithms for MAX SAT
HIRATA, Tomio
41566
ONO, Takao
41567
MAX SAT
approximation algorithms
semidefinite programming
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.
journal article
Institute of Electronics, Information and Communication Engineers
2000-03-20
application/pdf
IEICE transactions on information and systems
3
E83-D
488
495
http://www.ieice.org/jpn/trans_online/index.html
http://hdl.handle.net/2237/15068
0916-8532
https://nagoya.repo.nii.ac.jp/record/13173/files/467.pdf
eng
http://www.ieice.org/jpn/trans_online/index.html
Copyright (C) 2000 IEICE