Dynamic programming based algorithms for set multicover and multiset multicover problems

@article{Hua2010DynamicPB,
  title={Dynamic programming based algorithms for set multicover and multiset multicover problems},
  author={Qiang-Sheng Hua and Yuexuan Wang and Dongxiao Yu and Francis C. M. Lau},
  journal={Theor. Comput. Sci.},
  year={2010},
  volume={411},
  pages={2467-2474}
}
Given a universe N containing n elements and a collection of multisets or sets over N , the multiset multicover (MSMC) problem or the set multicover (SMC) problem is to cover all elements at least a number of times as specified in their coverage requirements with the minimum number of multisets or sets. In this paper, we give various exact algorithms for these two problems with or without constraints on the number of times a multiset or set may be chosen. First, we show that… CONTINUE READING
19 Citations
26 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 19 extracted citations

Similar Papers

Loading similar papers…