Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
1143177 | Operations Research Letters | 2007 | 6 Pages |
Abstract
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).
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Federico Della Croce, Bruno Escoffier, Vangelis Th. Paschos,