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

02/09/2021
by   Bingkai Lin, et al.
0

For every graph G, let ω(G) be the largest size of complete subgraph in G. This paper presents a simple algorithm which, on input a graph G, a positive integer k and a small constant ϵ>0, outputs a graph G' and an integer k' in 2^Θ(k^5)· |G|^O(1)-time such that (1) k'≤ 2^Θ(k^5), (2) if ω(G)≥ k, then ω(G')≥ k', (3) if ω(G)<k, then ω(G')< (1-ϵ)k'. This implies that no f(k)· |G|^O(1)-time algorithm can distinguish between the cases ω(G)≥ k and ω(G)<k/c for any constant c≥ 1 and computable function f, unless FPT= W[1].

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/28/2021

On Lower Bounds of Approximating Parameterized k-Clique

Given a simple graph G and an integer k, the goal of k-Clique problem is...
research
04/06/2023

Improved Hardness of Approximating k-Clique under ETH

In this paper, we prove that assuming the exponential time hypothesis (E...
research
12/07/2021

Almost Polynomial Factor Inapproximability for Parameterized k-Clique

The k-Clique problem is a canonical hard problem in parameterized comple...
research
12/28/2018

Isolation of k-cliques

For any positive integer k and any n-vertex graph G, let ι(G,k) denote t...
research
08/03/2020

Approximating pathwidth for graphs of small treewidth

We describe a polynomial-time algorithm which, given a graph G with tree...
research
03/06/2023

The Complexity of Geodesic Spanners

A geometric t-spanner for a set S of n point sites is an edge-weighted g...
research
11/29/2017

A note on time hierarchies for reasonable semantic classes without advice

We show time hierarchies for reasonable semantic classes without advice ...

Please sign up or login with your details

Forgot password? Click here to reset