Constant approximating k-clique is w[1]-hard

DOI10.1145/3406325.3451016arXiv2102.04769OpenAlexW3167294045MaRDI QIDQ6065290

Bingkai Lin

Publication date: 14 November 2023

Published in: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2102.04769

zbMATH Keywords

\(k\)-clique\(W[1\)-hard]\(k\)-vector-sumFPT-inapproximability

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

On the parameterized complexity of compact set packing

This page was built for publication: Constant approximating k-clique is w[1]-hard