Application of the Second Stirling Numbers on Approximate Counting of the Finite Set Covering
Qin Li · Journal of Nanjing University of Posts and Telecommunications · 2011
In the field of approximation algorithms,Set Covering Calculation is one of the problems that has been studied profoundly.Combining with the Second Stirling Numbers,this paper introduces an algorithm about how to construct the finite set covering and discusses its correctness.The algorithm is straight forword and efficient,which can calculate the lower bound of finite set covering calculation on the condition of limited calculating resources.