Show simple item record

dc.contributor.authorBonnet, Edouard
dc.contributor.authorEscoffier, Bruno
dc.contributor.authorKim, Eun Jung
dc.contributor.authorPaschos, Vangelis
dc.date.accessioned2014-06-16T12:19:08Z
dc.date.available2014-06-16T12:19:08Z
dc.date.issued2015
dc.identifier.urihttps://basepub.dauphine.fr/handle/123456789/13460
dc.language.isoenen
dc.subjectInapproximabilityen
dc.subjectSubexponential timeen
dc.subjectFPT-timeen
dc.subjectAPETHen
dc.subject.ddc005en
dc.titleOn Subexponential and FPT-Time Inapproximabilityen
dc.typeArticle accepté pour publication ou publié
dc.description.abstractenFixed-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.en
dc.relation.isversionofjnlnameAlgorithmica
dc.relation.isversionofjnlvol71
dc.relation.isversionofjnlissue3
dc.relation.isversionofjnldate2015
dc.relation.isversionofjnlpages541-565
dc.relation.isversionofdoihttp://dx.doi.org/10.1007/s00453-014-9889-1en
dc.identifier.urlsitehttps://hal.archives-ouvertes.fr/hal-01099850
dc.relation.isversionofjnlpublisherSpringeren
dc.subject.ddclabelProgrammation, logiciels, organisation des donnéesen
dc.relation.forthcomingnonen


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record