A Survey on Parameterized Inapproximability: k-Clique, k-SetCover, and More

12/09/2021
by   Xuandi Ren, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/31/2022

XNLP-completeness for Parameterized Problems on Graphs with a Linear Structure

In this paper, we show several parameterized problems to be complete for...
research
02/07/2023

Tight algorithms for connectivity problems parameterized by clique-width

The complexity of problems involving global constraints is usually much ...
research
04/30/2018

Fundamentals of Parameterized Complexity Revisited

What is a parameterized algorithm? What is a parameterized problem and w...
research
06/01/2021

Parameterized algorithms for identifying gene co-expression modules via weighted clique decomposition

We present a new combinatorial model for identifying regulatory modules ...
research
07/10/2023

Tight Algorithmic Applications of Clique-Width Generalizations

In this work, we study two natural generalizations of clique-width intro...
research
04/15/2023

Simple Combinatorial Construction of the k^o(1)-Lower Bound for Approximating the Parameterized k-Clique

In the parameterized k-clique problem, or k-Clique for short, we are giv...
research
07/29/2019

Parameterized Valiant's Classes

We define a theory of parameterized algebraic complexity classes in anal...

Please sign up or login with your details

Forgot password? Click here to reset