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

[1]  Michal Wlodarczyk.  Parameterized Inapproximability for Steiner Orientation by Gap Amplification , 2020, ICALP.

[2]  Bingkai Lin,et al.  The Parameterized Complexity of the k-Biclique Problem , 2018, J. ACM.

[3]  Russell Impagliazzo,et al.  Which Problems Have Strongly Exponential Complexity? , 2001, J. Comput. Syst. Sci..

[4]  Prasad Raghavendra,et al.  A Birthday Repetition Theorem and Complexity of Approximating Dense CSPs , 2016, ICALP.

[5]  Dániel Marx,et al.  Parameterized Complexity and Approximation Algorithms , 2008, Comput. J..

[6]  Uriel Feige,et al.  Two-Prover Protocols - Low Error at Affordable Rates , 2000, SIAM J. Comput..

[7]  Manuel Blum,et al.  Self-testing/correcting with applications to numerical problems , 1990, STOC '90.

[8]  J. Håstad.  Clique is hard to approximate within n 1-C , 1996 .

[9]  Rolf Niedermeier.  DATA REDUCTION AND PROBLEM KERNELS , 2006 .

[10]  Oded Goldreich.  Notes on Linearity ( Group Homomorphism ) Testing , 2016 .

[11]  Pasin Manurangsi,et al.  On the parameterized complexity of approximating dominating set , 2017, Electron. Colloquium Comput. Complex..

[12]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[13]  J. Håstad.  Clique is hard to approximate withinn1−ε , 1999 .

[14]  Stasys Jukna,et al.  Extremal Combinatorics - With Applications in Computer Science , 2001, Texts in Theoretical Computer Science. An EATCS Series.

[15]  László Lovász,et al.  Interactive proofs and the hardness of approximating cliques , 1996, JACM.

[16]  Shafi Goldwasser.  Introduction to Special Section on Probabilistic Proof Systems , 1998, SIAM J. Comput..

[17]  S. KarthikC.,et al.  On Hardness of Approximation of Parameterized Set Cover and Label Cover: Threshold Graphs from Error Correcting Codes , 2020, SOSA.

[18]  Vangelis Th. Paschos,et al.  On Subexponential and FPT-Time Inapproximability , 2013, Algorithmica.

[19]  Saket Saurabh,et al.  Parameterized Complexity and Approximability of Directed Odd Cycle Transversal , 2017, SODA.

[20]  Bingkai Lin,et al.  A Simple Gap-producing Reduction for the Parameterized Set Cover Problem , 2019, ICALP.

[21]  Subhash Khot,et al.  On Hardness of Approximating the Parameterized Clique Problem , 2016, Electron. Colloquium Comput. Complex..

[22]  Sanjeev Arora,et al.  Probabilistic checking of proofs: a new characterization of NP , 1998, JACM.

[23]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[24]  Pasin Manurangsi,et al.  A Survey on Approximation in Parameterized Complexity: Hardness and Algorithms , 2020, Electron. Colloquium Comput. Complex..

[25]  Yijia Chen,et al.  The Constant Inapproximability of the Parameterized Dominating Set Problem , 2015, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).

[26]  Guy Kortsarz,et al.  Fixed Parameter Inapproximability for Clique and SetCover in Time Super-exponential in OPT , 2013, 1310.2711.

[27]  Carsten Lund,et al.  Efficient probabilistically checkable proofs and applications to approximations , 1993, STOC.

[28]  David Zuckerman,et al.  Electronic Colloquium on Computational Complexity, Report No. 100 (2005) Linear Degree Extractors and the Inapproximability of MAX CLIQUE and CHROMATIC NUMBER , 2005 .

[29]  Michael R. Fellows,et al.  Fixed-Parameter Tractability and Completeness II: On Completeness for W[1] , 1995, Theor. Comput. Sci..

[30]  Luca Trevisan,et al.  From Gap-ETH to FPT-Inapproximability: Clique, Dominating Set, and More , 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).

[31]  Ryan Williams,et al.  On the parameterized complexity of k-SUM , 2013, ArXiv.

[32]  Carsten Lund,et al.  Proof verification and the hardness of approximation problems , 1998, JACM.

[33]  Yijia Chen,et al.  On Parameterized Approximability , 2006, IWPEC.

[34]  Irit Dinur,et al.  Mildly exponential reduction from gap 3SAT to polynomial-gap label-cover , 2016, Electron. Colloquium Comput. Complex..

[35]  Mihir Bellare,et al.  Improved non-approximability results , 1994, STOC '94.

[36]  Michael R. Fellows,et al.  Parameterized Complexity , 1998 .

[37]  Pasin Manurangsi,et al.  On the Parameterized Complexity of Approximating Dominating Set , 2019, J. ACM.