On Subexponential and FPT-Time Inapproximability

Abstract : 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.
Type de document :
Article dans une revue
Liste complète des métadonnées

Littérature citée [38 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/hal-01099850
Contributeur : Bruno Escoffier <>
Soumis le : mercredi 16 septembre 2015 - 16:37:12
Dernière modification le : mercredi 21 mars 2018 - 18:58:11
Document(s) archivé(s) le : lundi 28 décembre 2015 - 22:30:35

Fichier

param&subexp_approx_algo.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

UPMC | LIP6 | PSL

Citation

Edouard Bonnet, Bruno Escoffier, Eunjung Kim, Vangelis Paschos. On Subexponential and FPT-Time Inapproximability. Algorithmica, Springer Verlag, 2015, 71 (3), pp.541-565. 〈http://link.springer.com/article/10.1007/s00453-014-9889-1〉. 〈10.1007/s00453-014-9889-1〉. 〈hal-01099850〉

Partager

Métriques

Consultations de la notice

150

Téléchargements de fichiers

76