Department of Computer Science
 
Chair V

 
University of Bonn -> Department of Computer Science -> Chair V
CS-Reports 2003 Copyright 2003 University of Bonn, Department of Computer Science, Abt. V
85247

07.02.2003

1.0957-Approximation Algorithm for Random MAX-3SAT
W. Fernandez de la Vega and Marek Karpinski
[Download PostScript] [Download PDF]

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

Last Change: 11/05/14 at 10:28:56
 Deutsch 		University of Bonn -> Department of Computer Science -> Chair V