Abstract
Let k be fixed. Let n and m denote integers and C = {C1,...,Cm} a family of m subsets drawn from an n-element set C. A subset H\(\subseteq\)C is a hitting set for the family C if H has a non-empty intersection with each element of this family and the minimum hitting set problem is that of finding a hitting set of minimum cardinality. The purpose of this paper is to study the efficiency of a natural greedy algorithm for the approximate solution of the minimum hitting set probl em when C is a random family of k-element subsets, k fixed, and when n and m tend to ∞ with \(\tfrac{m}{n}\)= α, a fixed constant.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.