Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > BOUNDED MAX-2SAT:
Reports tagged with Bounded MAX-2SAT:
TR98-029 | 27th May 1998
Piotr Berman, Marek Karpinski

On Some Tighter Inapproximability Results

We prove a number of improved inaproximability results,
including the best up to date explicit approximation
thresholds for MIS problem of bounded degree, bounded
occurrences MAX-2SAT, and bounded degree Node Cover. We
prove also for the first time inapproximability of the
problem of Sorting by ... more >>>




ISSN 1433-8092 | Imprint