In This Problem We Are Given A Family Of Finite Sets S1 Sm And A Number K F We C

in this problem we are given a family of finite sets S1,…,Sm and a number k<|F|.we call U = Ui=1to m Si universal set and denote its size n.We are asked to find a subfamily F’c F of size k such that every element of U is contained in at least one set of the family F’.Note that MinSC in NP-complete.Design backtracking D&C algorithm for this problem,prove its correctness and estimate its run time.

 

"Looking for a Similar Assignment? Get Expert Help at an Amazing Discount!"