Thumbnail - No thumbnail

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érence
External document link
http://arxiv.org/abs/1211.6656v1
Date
2013
Conference title
8th International Symposium, IPEC 2013
Conference date
2013-09
Conference city
Nice
Conference country
France
Book title
Parameterized and Exact Computation 8th International Symposium, IPEC 2013, Sophia Antipolis, France, September 4-6, 2013, Revised Selected Papers
Book author
Szeider, Stefan; Gutin, Gregory
Publisher
Springer
Series title
Lecture Notes in Computer Science
Series number
8246
Published in
Berlin
ISBN
978-3-319-03897-1
Pages
54-65
Publication identifier
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]
Bonnet, Édouard cc
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 set