Show simple item record

Subexponential and FPT-time Inapproximability of Independent Set and Related Problems

hal.structure.identifierLaboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
dc.contributor.authorEscoffier, Bruno
HAL ID: 5124
hal.structure.identifierLaboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
dc.contributor.authorKim, Eun Jung
hal.structure.identifierLaboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
dc.contributor.authorPaschos, Vangelis
dc.date.accessioned2020-07-22T11:08:34Z
dc.date.available2020-07-22T11:08:34Z
dc.date.issued2012
dc.identifier.urihttps://basepub.dauphine.fr/handle/123456789/20958
dc.language.isoenen
dc.subjectalgorithmsen
dc.subject.ddc005en
dc.titleSubexponential and FPT-time Inapproximability of Independent Set and Related Problemsen
dc.typeDocument de travail / Working paper
dc.description.abstractenFixed-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 different approaches. In particular, whether Independent Set would be better approximable once endowed with subexponential-time or fpt-time is a central question. In this paper, we present a strong link between the linear PCP conjecture and the inapproximability, thus partially answering this question.en
dc.publisher.cityParisen
dc.relation.ispartofseriestitleCahier du LAMSADEen
dc.relation.ispartofseriesnumber321en
dc.subject.ddclabelProgrammation, logiciels, organisation des donnéesen
dc.description.ssrncandidatenonen
dc.description.halcandidatenonen
dc.description.readershiprechercheen
dc.description.audienceInternationalen
dc.date.updated2020-07-22T11:06:12Z
hal.author.functionaut
hal.author.functionaut
hal.author.functionaut


Files in this item

Thumbnail
Name:
cahier_321.pdf
Size:
2.139Mb
Format:
PDF
View/Open

This item appears in the following Collection(s)

Show simple item record