Show simple item record

dc.contributor.authorBazgan, Cristina
dc.contributor.authorFernandez de la Vega, Wenceslas
dc.contributor.authorKarpinski, Marek
dc.date.accessioned2017-01-23T16:26:14Z
dc.date.available2017-01-23T16:26:14Z
dc.date.issued2002
dc.identifier.urihttps://basepub.dauphine.fr/handle/123456789/16206
dc.descriptionLNCS n°2368en
dc.language.isoenen
dc.subjectapproximationen
dc.subjectdense instancesen
dc.subject.ddc003en
dc.titleApproximability of Dense Instances of NEAREST CODEWORD Problemen
dc.typeCommunication / Conférence
dc.description.abstractenWe give a polynomial time approximation scheme (PTAS) for dense instances of the Nearest Codeword problem.en
dc.identifier.citationpages298-307en
dc.relation.ispartoftitleAlgorithm Theory — SWAT 2002 8th Scandinavian Workshop on Algorithm Theory Turku, Finland, July 3–5, 2002 Proceedingsen
dc.relation.ispartofeditorPenttonen, Martti
dc.relation.ispartofeditorMeineche Schmidt, Erik
dc.relation.ispartofpublnameSpringeren
dc.relation.ispartofpublcityBerlin Heidelbergen
dc.relation.ispartofdate2002
dc.relation.ispartofurl10.1007/3-540-45471-3en
dc.contributor.countryeditoruniversityotherFRANCE
dc.contributor.countryeditoruniversityotherGERMANY
dc.subject.ddclabelRecherche opérationnelleen
dc.relation.ispartofisbn978-3-540-43866-3en
dc.relation.conftitle8th Scandinavian Workshop on Algorithm Theory, SWAT 2002en
dc.relation.confdate2002-07
dc.relation.confcityTurkuen
dc.relation.confcountryFinlanden
dc.relation.forthcomingnonen
dc.identifier.doi10.1007/3-540-45471-3_31en
dc.description.ssrncandidatenonen
dc.description.halcandidateouien
dc.description.readershiprechercheen
dc.description.audienceInternationalen
dc.relation.Isversionofjnlpeerreviewednonen
dc.relation.Isversionofjnlpeerreviewednonen
dc.date.updated2017-01-20T18:00:12Z
hal.person.labIds989
hal.person.labIds460398
hal.person.labIds138571
hal.identifierhal-01444194*


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record