Yican Sun
Yican Sun
Home
Publications
Light
Dark
Automatic
On Lower Bounds of Approximating Parameterized k-Clique
Bingkai Lin
,
Xuandi Ren
,
Yican Sun
,
Xiuhan Wang
July 2022
PDF
Cite
Type
Conference paper
Publication
The 49th International Colloquium on Automata, Languages, and Programming (ICALP'22)
Related
Improved Hardness of Approximating k-Clique under ETH
Constant Approximating Parameterized k-SetCover is W[2]-hard
Almost Optimal Time Lower Bound for Approximating Parameterized Clique, CSP, and More, under ETH
Parameterized Inapproximability Hypothesis under ETH
Synthesizing Efficient Memoization Algorithms
Cite
×