Fixed Parameter Inapproximability for Clique and SetCover in Time Super-exponential in OPT

Abstract

In this paper, we consider proving inapproximability in terms of OPT and thus we base the foundations of fixed parameter inapproximability.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…