Show simple item record

dc.contributor.authorPaschos, Vangelis
dc.contributor.authorDella Croce, Federico
dc.contributor.authorEscoffier, Bruno
dc.date.accessioned2009-10-05T14:27:13Z
dc.date.available2009-10-05T14:27:13Z
dc.date.issued2007
dc.identifier.urihttps://basepub.dauphine.fr/handle/123456789/2121
dc.language.isoenen
dc.subjectExact algorithmen
dc.subjectMIN SET COVERINGen
dc.subjectWorst-case complexityen
dc.subject.ddc003en
dc.titleImproved worst-case complexity for the MIN 3-SET COVERING problemen
dc.typeArticle accepté pour publication ou publié
dc.contributor.editoruniversityotherD.A.I., Politecnico di Torino;Italie
dc.description.abstractenWe consider MIN SET COVERING when the subsets are constrained to have maximum cardinality 3. We propose an exact algorithm whose worst-case complexity is bounded above by O*(1.3957m), where m is the number of sets in the instance. This result improves upon the previously known bound of O*(1.4391m).en
dc.relation.isversionofjnlnameOperations Research Letters
dc.relation.isversionofjnlvol35en
dc.relation.isversionofjnlissue2en
dc.relation.isversionofjnldate2007
dc.relation.isversionofjnlpages205-210en
dc.relation.isversionofdoihttp://dx.doi.org/10.1016/j.orl.2006.02.004en
dc.description.sponsorshipprivateouien
dc.relation.isversionofjnlpublisherElsevieren
dc.subject.ddclabelRecherche opérationnelleen


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record