๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Approximation algorithms for MAX RES CUT with

โœ Scribed by Aifan Ling; Le Tang; Chengxian Xu

Book ID
107619932
Publisher
Springer-Verlag
Year
2009
Tongue
English
Weight
464 KB
Volume
33
Category
Article
ISSN
1598-5865

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Improved Approximation Algorithms for MA
Improved Approximation Algorithms for MAX SAT
โœ Takao Asano; David P. Williamson ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 215 KB

MAX SAT (the maximum s~tisfiability 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 approxima~ tion algorithms for MAX SAT proposed by Goemans and Williamson and pze