{"title":"MAX SAT的近似算法:Yannakakis vs. Goemans-Williamson","authors":"Takao Asano","doi":"10.1109/ISTCS.1997.595154","DOIUrl":null,"url":null,"abstract":"MAX SAT (the maximum satisfiability problem) is stated as follows: given a set of clauses with weights, find a truth assignment that maximizes the sum of the weights of the satisfied clauses. In this paper, we consider approximation algorithms for MAX SAT proposed by Yannnkakis and Goemans-Williamson and present an approximation algorithm which is an improvement of Yannakakis' algorithm. Although Yannakakis' original algorithm has no better performance guarantee than Goemans-Williamson, our improved algorithm has a better performance guarantee and leads to a 0.770 approximation algorithm.","PeriodicalId":367160,"journal":{"name":"Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems","volume":"40 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1997-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"43","resultStr":"{\"title\":\"Approximation algorithms for MAX SAT: Yannakakis vs. Goemans-Williamson\",\"authors\":\"Takao Asano\",\"doi\":\"10.1109/ISTCS.1997.595154\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"MAX SAT (the maximum satisfiability problem) is stated as follows: given a set of clauses with weights, find a truth assignment that maximizes the sum of the weights of the satisfied clauses. In this paper, we consider approximation algorithms for MAX SAT proposed by Yannnkakis and Goemans-Williamson and present an approximation algorithm which is an improvement of Yannakakis' algorithm. Although Yannakakis' original algorithm has no better performance guarantee than Goemans-Williamson, our improved algorithm has a better performance guarantee and leads to a 0.770 approximation algorithm.\",\"PeriodicalId\":367160,\"journal\":{\"name\":\"Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems\",\"volume\":\"40 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1997-06-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"43\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISTCS.1997.595154\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISTCS.1997.595154","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 43
摘要
MAX SAT(最大可满足性问题)的表述如下:给定一组具有权重的子句,找出一个使满足子句的权重总和最大化的真值赋值。本文考虑了Yannnkakis和Goemans-Williamson提出的MAX SAT近似算法,提出了一种改进Yannakakis算法的近似算法。虽然Yannakakis的原始算法没有比Goemans-Williamson更好的性能保证,但我们改进的算法有更好的性能保证,得到了0.770近似算法。
Approximation algorithms for MAX SAT: Yannakakis vs. Goemans-Williamson
MAX SAT (the maximum satisfiability problem) is stated as follows: given a set of clauses with weights, find a truth assignment that maximizes the sum of the weights of the satisfied clauses. In this paper, we consider approximation algorithms for MAX SAT proposed by Yannnkakis and Goemans-Williamson and present an approximation algorithm which is an improvement of Yannakakis' algorithm. Although Yannakakis' original algorithm has no better performance guarantee than Goemans-Williamson, our improved algorithm has a better performance guarantee and leads to a 0.770 approximation algorithm.