research
∙
04/06/2023
Improved Hardness of Approximating k-Clique under ETH
In this paper, we prove that assuming the exponential time hypothesis (E...
share
research
∙
02/09/2022
Constant Approximating Parameterized k-SetCover is W[2]-hard
In this paper, we prove that it is W[2]-hard to approximate k-SetCover w...
research
∙
12/09/2021
A Survey on Parameterized Inapproximability: k-Clique, k-SetCover, and More
In the past a few years, many interesting inapproximability results have...
research
∙
11/28/2021
On Lower Bounds of Approximating Parameterized k-Clique
Given a simple graph G and an integer k, the goal of k-Clique problem is...
research
∙
10/31/2020
