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.

References in corpus (2)

• Fixed-Parameter and Approximation Algorithms: A New Look
• Subexponential and FPT-time Inapproximability of Independent Set and Related Problems

Cited by in corpus (1)

• Constant Approximating k-Clique is W[1]-hard