A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
The paper contributes to the systematic study (started by Berman and Karpinski) of explicit approximability lower bounds for small occurrence optimization problems. We present parametrized reductions for some packing and covering problems, including 3-Dimensional Matching, and prove the best known inapproximability results even for highly restricted versions of them. For example, we show that it is NPhard to approximate Max-3-DM within 139 138 even on instances with exactly two occurrences ofdoi:10.1007/3-540-44849-7_21 fatcat:dvffpjwhvvg6lot3sstds2ffaq