2005 | OriginalPaper | Chapter
Computing Optimal Solutions for the min 3-set covering Problem
Authors : Federico Della Croce, Vangelis Th. Paschos
Published in: Algorithms and Computation
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
We 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.4492
n
).