
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 paperDate
2012Series title
Cahier du LAMSADESeries number
321Published in
Paris
Metadata
Show full item recordAuthor(s)
Escoffier, BrunoLaboratoire 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
algorithmsRelated items
Showing items related by title and author.
-
Escoffier, Bruno; Kim, Eun Jung; Paschos, Vangelis; Bonnet, Édouard (2013) Communication / Conférence
-
Bonnet, Édouard; Escoffier, Bruno; Kim, Eun Jung; Paschos, Vangelis (2015) Article accepté pour publication ou publié
-
Bourgeois, Nicolas; Escoffier, Bruno; Paschos, Vangelis (2011) Article accepté pour publication ou publié
-
Escoffier, Bruno; Monnot, Jérôme; Paschos, Vangelis; Xiao, Mingyu (2015) Article accepté pour publication ou publié
-
Escoffier, Bruno; Paschos, Vangelis (2005) Communication / Conférence