Department of Computer Science
 
Chair V

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

11.02.2003

Improved Approximation Lower Bounds on Small Occurrence Optimization
Piotr Berman and Marek Karpinski
[Download PostScript] [Download PDF]

We improve a number of approximation lower bounds for bounded occurrence optimization problems like MAX-2SAT, E2-LIN-2, Maximum Independent Set and Maximum-3D-Matching.

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