A Survey on Parameterized Inapproximability: k-Clique, k-SetCover, and More

12/09/2021
by   Xuandi Ren, et al.
0

In the past a few years, many interesting inapproximability results have been obtained from the parameterized perspective. This article surveys some of such results, with a focus on k-Clique, k-SetCover, and other related problems.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset
Success!
Error Icon An error occurred

Sign in with Google

×

Use your Google Account to sign in to DeepAI

×

Consider DeepAI Pro