Fixed Parameter Inapproximability for Clique and SetCover in Time Super-exponential in OPT
Computational Complexity
2013-12-06 v2 Data Structures and Algorithms
Abstract
In this paper, we consider proving inapproximability in terms of OPT and thus we base the foundations of fixed parameter inapproximability.
Cite
@article{arxiv.1310.2711,
title = {Fixed Parameter Inapproximability for Clique and SetCover in Time Super-exponential in OPT},
author = {Mohammad T. Hajiaghayi and Rohit Khandekar and Guy Kortsarz},
journal= {arXiv preprint arXiv:1310.2711},
year = {2013}
}
Related papers
View all related →
Computational Complexity · Computer Science
Subexponential and FPT-time Inapproximability of Independent Set and Related Problems
Bruno Escoffier, EunJung Kim, Vangelis Th. Paschos
2012-11-29
Computational Complexity · Computer Science
A Survey on Parameterized Inapproximability: $k$-Clique, $k$-SetCover, and More
Xuandi Ren
2021-12-13
Data Structures and Algorithms · Computer Science
Fixed-Parameter and Approximation Algorithms: A New Look
Rajesh Chitnis, MohammadTaghi Hajiaghayi, Guy Kortsarz
2013-08-19
Computational Complexity · Computer Science
Parameterized (in)approximability of subset problems
Edouard Bonnet, Vangelis Th. Paschos
2013-10-22
Computational Complexity · Computer Science
From Gap-ETH to FPT-Inapproximability: Clique, Dominating Set, and More
Parinya Chalermsook, Marek Cygan, Guy Kortsarz, Bundit Laekhanukit +3
2017-08-15
Computational Complexity · Computer Science
Almost Polynomial Factor Inapproximability for Parameterized k-Clique
Karthik C. S., Subhash Khot
2025-01-28
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
PCP Theorems, SETH and More: Towards Proving Sub-linear Time Inapproximability
Hengzhao Ma, Jianzhong Li
2022-03-25
Computational Complexity · Computer Science
Almost Optimal Time Lower Bound for Approximating Parameterized Clique, CSP, and More, under ETH
Venkatesan Guruswami, Bingkai Lin, Xuandi Ren, Yican Sun +1
2024-06-13
Logic in Computer Science · Computer Science
Definable Inapproximability: New Challenges for Duplicator
Albert Atserias, Anuj Dawar
2019-08-30
Data Structures and Algorithms · Computer Science
Upper Dominating Set: Tight Algorithms for Pathwidth and Sub-Exponential Approximation
Louis Dublois, Michael Lampis, Vangelis Th. Paschos
2021-01-20
Computational Complexity · Computer Science
The PCP-like Theorem for Sub-linear Time Inapproximability
Hengzhao Ma, Jianzhong Li
2024-01-03
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
Computational Complexity · Computer Science
Parameterized Inapproximability Hypothesis under ETH
Venkatesan Guruswami, Bingkai Lin, Xuandi Ren, Yican Sun +1
2023-11-29
Data Structures and Algorithms · Computer Science
Exponential-Time Approximation of Hard Problems
Marek Cygan, Lukasz Kowalik, Marcin Pilipczuk, Mateusz Wykurz
2008-10-29
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
Computational Complexity · Computer Science
The Constant Inapproximability of the Parameterized Dominating Set Problem
Yijia Chen, Bingkai Lin
2015-11-17
Systems and Control · Electrical Eng. & Systems
Tractable higher-order under-approximating AE extensions for non-linear systems
Eric Goubault, Sylvie Putot
2021-01-28
Data Structures and Algorithms · Computer Science
Tight Bounds on Subexponential Time Approximation of Set Cover and Related Problems
Marek Cygan, Magnús M. Halldórsson, Guy Kortsarz
2020-08-13
Computational Complexity · Computer Science
Independent Set, Induced Matching, and Pricing: Connections and Tight (Subexponential Time) Approximation Hardnesses
Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai
2013-08-20
Computational Geometry · Computer Science
Parameterized and approximation algorithms for coverings points with segments in the plane
Katarzyna Kowalska, Michał Pilipczuk
2024-02-27
Data Structures and Algorithms · Computer Science
FPT Inapproximability of Directed Cut and Connectivity Problems
Rajesh Chitnis, Andreas Emil Feldmann
2019-10-07
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
Tighter inapproximability for set cover
David G. Harris
2017-02-17
Computational Geometry · Computer Science
QPTAS and Subexponential Algorithm for Maximum Clique on Disk Graphs
Édouard Bonnet, Panos Giannopoulos, Eun Jung Kim, Paweł Rzążewski +1
2018-03-01