English

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}
}
R2 v1 2026-06-22T01:43:55.075Z