Cobweb algorithm of computing minimum hitting sets
求极小碰集的蛛网算法

To reduce space complexity and reduce search time, this paper proposed a cobweb algorithm for search minimum hitting sets, which combined the characteristics of minimum hitting sets and thought on spider prey in biology. It considered this method the correlation between the sets, and structured the visiting spider which could find the path of the cobweb access to find all minimum hitting sets of sets within the cobweb. In the algorithm, the generation of visiting spiders and search strategy could reduce space complexity and reduce search time. Compared with the other algorithms which computing the minimum hitting sets, the results of experiments show that under the premise of guaranteeing to get all minimum hitting sets, the algorithm has lower space complexity and higher efficiency.