On Some Tighter Inapproximability Results

Authors:
Berman Piotr;Karpinski Marek
Affiliations:
-;-
Venue:
On Some Tighter Inapproximability Results
Year:
1999

Citing 0
Cited 4

Computing Shortest Paths with Uncertainty

STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Optimal Replacement Is NP-Hardfor Nonstandard Caches

IEEE Transactions on Computers
Computing shortest paths with uncertainty

Journal of Algorithms
The transposition median problem is NP-complete

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give a number of improved inapproximability results, including the best up to date explicit approximation thresholds for bounded occurrence satisfiability problems like MAX-2SAT and E2-LIN-2, and the bounded degree graph problems, like MIS, NodeCover, and MAX CUT. We prove also for the first time inapproximability of the problem of Sorting by Reversals and display an explicit approximation threshold.