一类覆盖问题的组合学分析

Combinational Analysis for a Class of Set Covering Problem

从组合学的角度研究了一类随机选取集合中元素的覆盖问题,得到了重复性地、随机独立地、等概地选取某个有限集合中的元素,不遗漏地取遍所有元素所需的次数的期望,给出了理论和实验的数据结果.并且分析了该问题在现实世界中的一些实例.而且对于该问题的扩展模型—每次抽取集合中t个不同元素—进行了一些探讨.

A combinational analysis of a class of random set covering problem is investigated. The expect times of randomly choosing to get all the elements in the set is presented. The theoretical and simulated results and comparison are also given. The expand modeling of this problem is discussed and some preliminary results is given.