On Subexponential and FPT-time Inapproximability
Escoffier, Bruno; Kim, Eun Jung; Paschos, Vangelis; Bonnet, Édouard (2013), On Subexponential and FPT-time Inapproximability, in Szeider, Stefan; Gutin, Gregory, Parameterized and Exact Computation 8th International Symposium, IPEC 2013, Sophia Antipolis, France, September 4-6, 2013, Revised Selected Papers, Springer : Berlin, p. 54-65. 10.1007/978-3-319-03898-8_6
Type
Communication / ConférenceExternal document link
http://arxiv.org/abs/1211.6656v1Date
2013Conference title
8th International Symposium, IPEC 2013Conference date
2013-09Conference city
NiceConference country
FranceBook title
Parameterized and Exact Computation 8th International Symposium, IPEC 2013, Sophia Antipolis, France, September 4-6, 2013, Revised Selected PapersBook author
Szeider, Stefan; Gutin, GregoryPublisher
Springer
Series title
Lecture Notes in Computer ScienceSeries number
8246Published in
Berlin
ISBN
978-3-319-03897-1
Pages
54-65
Publication identifier
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]
Bonnet, Édouard

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 these different frameworks. In particular, whether Independent Set would be better approximable once endowed with subexponential-time or FPT-time is a central question. In this article, we provide new insights to this question using two complementary approaches; the former makes a strong link between the linear PCP conjecture and inapproximability; the latter builds a class of equivalent problems under approximation in subexponential time.Subjects / Keywords
algorithms design; Independent setRelated items
Showing items related by title and author.
-
Bonnet, Édouard; Escoffier, Bruno; Kim, Eun Jung; Paschos, Vangelis (2015) Article accepté pour publication ou publié
-
Escoffier, Bruno; Kim, Eun Jung; Paschos, Vangelis (2012) Document de travail / Working paper
-
Bonamy, Marthe; Bonnet, Edouard; Bousquet, Nicolas; Charbit, Pierre; Giannopoulos, Panos; Kim, Eun Jung; Rzążewski, P.; Sikora, Florian; Thomassé, S. (2021) Article accepté pour publication ou publié
-
Bonnet, Édouard; Giannopoulos, Panos; Kim, Eun Jung; Rzążewski, Pawel; Sikora, Florian (2018) Communication / Conférence
-
Bonnet, Édouard; Escoffier, Bruno; Paschos, Vangelis; Tourniaire, Emeric (2012) Document de travail / Working paper