Approximation Algorithms for MAX SAT
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Information Vol.E83-D No.3 pp.488-495
- Publication Date
- 2000/03/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- INVITED SURVEY PAPER
- Category
- Approximate Algorithms for Combinatorial Problems
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Tomio HIRATA, Takao ONO, "Approximation Algorithms for MAX SAT" in IEICE TRANSACTIONS on Information,
vol. E83-D, no. 3, pp. 488-495, March 2000, doi: .
Abstract: 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.
URL: https://global.ieice.org/en_transactions/information/10.1587/e83-d_3_488/_p
Copy
@ARTICLE{e83-d_3_488,
author={Tomio HIRATA, Takao ONO, },
journal={IEICE TRANSACTIONS on Information},
title={Approximation Algorithms for MAX SAT},
year={2000},
volume={E83-D},
number={3},
pages={488-495},
abstract={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.},
keywords={},
doi={},
ISSN={},
month={March},}
Copy
TY - JOUR
TI - Approximation Algorithms for MAX SAT
T2 - IEICE TRANSACTIONS on Information
SP - 488
EP - 495
AU - Tomio HIRATA
AU - Takao ONO
PY - 2000
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E83-D
IS - 3
JA - IEICE TRANSACTIONS on Information
Y1 - March 2000
AB - 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.
ER -
English
