Thumbnail

Subexponential and FPT-time Inapproximability of Independent Set and Related Problems

Escoffier, Bruno; Kim, Eun Jung; Paschos, Vangelis (2012), Subexponential and FPT-time Inapproximability of Independent Set and Related Problems. https://basepub.dauphine.fr/handle/123456789/20958

View/Open
Type
Document de travail / Working paper
Date
2012
Series title
Cahier du LAMSADE
Series number
321
Published in
Paris
Metadata
Show full item record
Author(s)
Escoffier, Bruno
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Kim, Eun Jung
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Paschos, Vangelis
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Abstract (EN)
Fixed-parameter algorithms, approximation algorithms and moderately exponential algorithms are three major approaches to algorithms design. While each of them being very active in its own, there is an increasing attention to the connection between different approaches. In particular, whether Independent Set would be better approximable once endowed with subexponential-time or fpt-time is a central question. In this paper, we present a strong link between the linear PCP conjecture and the inapproximability, thus partially answering this question.
Subjects / Keywords
algorithms