Volume 41, Number 1, January-March 2007
|Page(s)||95 - 103|
|Published online||15 June 2007|
1.0957-Approximation Algorithm for Random MAX-3SAT
CNRS, université Paris Sud, Orsay, France; email@example.com
2 Dept. of Computer Science, University of Bonn, Germany; firstname.lastname@example.org
Accepted: 16 October 2006
We prove that MAX-3SAT can be approximated in polynomial time within a factor 1.0957 on random instances.
Mathematics Subject Classification: 68W25 / 03B70
Key words: Random satisfiability / approximate algorithms.
© EDP Sciences, ROADEF, SMAI, 2007
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.