Improved Approximation Algorithms for MAX SAT (2000)
Cached
Download Links
- [www.almaden.ibm.com]
- [legacy.orie.cornell.edu]
- [www.ti.inf.ethz.ch]
- DBLP
Other Repositories/Bibliography
by
Takao Asano
,
David P. Williamson
| Venue: | In Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'00 |
| Citations: | 31 - 0 self |
BibTeX
@INPROCEEDINGS{Asano00improvedapproximation,
author = {Takao Asano and David P. Williamson},
title = {Improved Approximation Algorithms for MAX SAT},
booktitle = {In Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'00},
year = {2000},
pages = {96--105},
publisher = {ACM}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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 Goemans and Williamson and present a sharpened analysis of their performance guarantees.
