Approximation Algorithms for MAX SAT(Special Issue on Algorithm Engineering : Surveys)

スポンサーリンク

概要

• 論文の詳細を見る

• 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.

• 社団法人電子情報通信学会の論文
• 2000-03-25

著者

• Hirata Tomio

  The School Of Engineering Nagoya University

• ONO Takao

  The School of Engineering, Nagoya University

• Ono Takao

  The School Of Engineering Nagoya University

関連論文

• Approximation Algorithms for MAX SAT(Special Issue on Algorithm Engineering : Surveys)

スポンサーリンク