Author
Paschos, Vangelis
Della Croce, Federico
Escoffier, Bruno
Type
Article accepté pour publication ou publié
Abstract (EN)
We 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).
