A Survey on Parameterized Inapproximability: $k$-Clique, $k$-SetCover, and More
Computational Complexity
2021-12-13 v2
Authors:
Xuandi Ren
Abstract
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.
Cite
@article{arxiv.2112.04669,
title = {A Survey on Parameterized Inapproximability: $k$-Clique, $k$-SetCover, and More},
author = {Xuandi Ren},
journal= {arXiv preprint arXiv:2112.04669},
year = {2021}
}
Related papers
View all related →
Computational Complexity · Computer Science
Fixed Parameter Inapproximability for Clique and SetCover in Time Super-exponential in OPT
Mohammad T. Hajiaghayi, Rohit Khandekar, Guy Kortsarz
2013-12-06
Computational Complexity · Computer Science
Almost Polynomial Factor Inapproximability for Parameterized k-Clique
Karthik C. S., Subhash Khot
2025-01-28
Computational Complexity · Computer Science
Simple Combinatorial Construction of the $k^{o(1)}$-Lower Bound for Approximating the Parameterized $k$-Clique
Yijia Chen, Yi Feng, Bundit Laekhanukit, Yanlin Liu
2024-08-12
Data Structures and Algorithms · Computer Science
Parameterized Approximation Schemes using Graph Widths
Michael Lampis
2014-02-18
Data Structures and Algorithms · Computer Science
On the Average-case Complexity of Parameterized Clique
Nikolaos Fountoulakis, Tobias Friedrich, Danny Hermelin
2014-10-24
Data Structures and Algorithms · Computer Science
Clique cover and graph separation: New incompressibility results
Marek Cygan, Stefan Kratsch, Marcin Pilipczuk, Michał Pilipczuk +1
2011-11-03
Data Structures and Algorithms · Computer Science
A Survey on Approximation in Parameterized Complexity: Hardness and Algorithms
Andreas Emil Feldmann, Karthik C. S., Euiwoong Lee, Pasin Manurangsi
2020-06-09
Computational Complexity · Computer Science
Parameterized (in)approximability of subset problems
Edouard Bonnet, Vangelis Th. Paschos
2013-10-22
Computational Complexity · Computer Science
On Lower Bounds of Approximating Parameterized $k$-Clique
Bingkai Lin, Xuandi Ren, Yican Sun, Xiuhan Wang
2022-08-04
Computational Complexity · Computer Science
Parameterized Inapproximability of Exact Cover and Nearest Codeword
Venkatesan Guruswami, Patrick Lin
2019-05-21
Computational Complexity · Computer Science
Parameterized Exact and Approximation Algorithms for Maximum $k$-Set Cover and Related Satisfiability Problems
Edouard Bonnet, Vangelis Th. Paschos, Florian Sikora
2016-09-28
Data Structures and Algorithms · Computer Science
Computing Clique Cover with Structural Parameterization
Ahammed Ullah
2022-08-29
Artificial Intelligence · Computer Science
Parameterized Complexity Results in Symmetry Breaking
Toby Walsh
2015-05-19
Computational Complexity · Computer Science
A Chronology of Set Cover Inapproximability Results
Erika Melder
2021-11-30
Computational Complexity · Computer Science
Improved Inapproximability of VC Dimension and Littlestone's Dimension via (Unbalanced) Biclique
Pasin Manurangsi
2022-11-04
Computational Complexity · Computer Science
Knapsack Problems: A Parameterized Point of View
Carolin Albrecht, Frank Gurski, Jochen Rethmann, Eda Yilmaz
2016-11-24
Data Structures and Algorithms · Computer Science
Parameterized Study of the Test Cover Problem
R. Crowston, G. Gutin, M. Jones, S. Saurabh +1
2012-12-04
Computational Complexity · Computer Science
Reoptimization of Parameterized Problems
Hans-Joachim Böckenhauer, Elisabet Burjons, Martin Raszyk, Peter Rossmanith
2019-07-31
Data Structures and Algorithms · Computer Science
Constant Approximating Parameterized $k$-SetCover is W[2]-hard
Bingkai Lin, Xuandi Ren, Yican Sun, Xiuhan Wang
2022-10-25
Artificial Intelligence · Computer Science
The Parameterized Complexity of Global Constraints
Christian Bessiere, Emmanuel Hebrard, Brahim Hnich, Zeynep Kiziltan +1
2009-03-04
Computational Complexity · Computer Science
Improved Approximation Lower Bounds for Vertex Cover on Power Law Graphs and Some Generalizations
Mikael Gast, Mathias Hauptmann, Marek Karpinski
2012-10-10
Combinatorics · Mathematics
Compressed Cliques Graphs, Clique Coverings and Positive Zero Forcing
Shaun Fallat, Karen Meagher, Abolghasem Soltani, Boting Yang
2015-09-01
Data Structures and Algorithms · Computer Science
Consistency-Checking Problems: A Gateway to Parameterized Sample Complexity
Robert Ganian, Liana Khazaliya, Kirill Simonov
2023-08-23
Data Structures and Algorithms · Computer Science
Almost Optimal Bounds for Sublinear-Time Sampling of $k$-Cliques: Sampling Cliques is Harder Than Counting
Talya Eden, Dana Ron, Will Rosenbaum
2020-12-09
Data Structures and Algorithms · Computer Science
Parameterized Complexity of Graph Burning
Yasuaki Kobayashi, Yota Otachi
2020-09-29