Thumbnail - No thumbnail

On Subexponential and FPT-Time Inapproximability

Bonnet, Édouard; Escoffier, Bruno; Kim, Eun Jung; Paschos, Vangelis (2015), On Subexponential and FPT-Time Inapproximability, Algorithmica, 71, 3, p. 541-565. http://dx.doi.org/10.1007/s00453-014-9889-1

Type
Article accepté pour publication ou publié
External document link
https://hal.archives-ouvertes.fr/hal-01099850
Date
2015
Journal name
Algorithmica
Volume
71
Number
3
Publisher
Springer
Pages
541-565
Publication identifier
Metadata
Show full item record
Author(s)
Bonnet, Édouard cc
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Escoffier, Bruno
Laboratoire d'Informatique de Paris 6 [LIP6]
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 algorithm 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
Inapproximability; Subexponential time; FPT-time; APETH