Department of Computer Science
 
Chair V

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

On Some Tighter Inapproximability Results, Further Improvements
Marek Karpinski, Piotr Berman
[Download PostScript] [Download PDF]

Improved inaproximability results are given, including the best up to date explicit approximation thresholds for bounded occurence satisfiability problems, like MAX-2SAT and E2-LIN-2, and problems in bounded degree graphs, like MIS, Node Cover and MAX CUT. We prove also for the first time inapproximability of the problem of Sorting by Reversals and display an explicit approximation threshold for this problem.

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