1.0957-approximation algorithm for random MAX-3SAT

1.0957-approximation algorithm for random MAX-3SAT

0.00 Avg rating0 Votes
Article ID: iaor20073396
Country: France
Volume: 41
Issue: 1
Start Page Number: 95
End Page Number: 103
Publication Date: Jan 2007
Journal: RAIRO Operations Research
Authors: ,
Abstract:

We prove that MAX-3SAT can be approximated in polynomial time within a factor 1.0957 on random instances.

Reviews

Required fields are marked *. Your email address will not be published.