Under the auspices of the Computational Complexity Foundation (CCF)
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.
