Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > DETAIL:

Paper:

TR03-008 | 11th February 2003 00:00

Improved Approximation Lower Bounds on Small Occurrence Optimization

RSS-Feed

Abstract:

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.



ISSN 1433-8092 | Imprint