Show simple item record

dc.contributor.authorDella Croce, Federico
dc.contributor.authorPaschos, Vangelis
dc.date.accessioned2011-03-22T13:49:55Z
dc.date.available2011-03-22T13:49:55Z
dc.date.issued2005
dc.identifier.urihttps://basepub.dauphine.fr/handle/123456789/5790
dc.language.isoenen
dc.subjectAlgorithmsen
dc.subject.ddc003en
dc.titleComputing optimal solutions for the MIN 3-SET COVERING problemen
dc.typeCommunication / Conférence
dc.description.abstractenWe consider min set covering when the subsets are constrained to have maximum cardinality three. We propose an exact algorithm whose worst case complexity is bounded above by O*(1.4492n).en
dc.identifier.citationpages685-692en
dc.relation.ispartofseriestitleLecture Notes in Computer Science
dc.relation.ispartofseriesnumber3827
dc.relation.ispartoftitleAlgorithms and Computation 16th International Symposium, ISAAC 2005, Sanya, Hainan, China, December 19-21, 2005, Proceedingsen
dc.relation.ispartofeditorDu, Ding-Zhu
dc.relation.ispartofeditorDeng, Xiaotie
dc.relation.ispartofpublnameSpringeren
dc.relation.ispartofpublcityBerlinen
dc.relation.ispartofdate2005
dc.relation.ispartofpages1190en
dc.relation.ispartofurlhttp://dx.doi.org/10.1007/11602613en
dc.description.sponsorshipprivateouien
dc.subject.ddclabelRecherche opérationnelleen
dc.relation.ispartofisbn978-3-540-30935-2en
dc.relation.conftitle16th International Symposium on Algorithms and Computation (ISAAC'05)en
dc.relation.confdate2005-12
dc.relation.confcitySanya (Hainan)en
dc.relation.confcountryChineen
dc.identifier.doihttp://dx.doi.org/10.1007/11602613_69


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