A faster branch-and-bound algorithm for the test-cover problem based on set-covering techniques

Torsten Fahle, Karsten Tiemann. A faster branch-and-bound algorithm for the test-cover problem based on set-covering techniques. ACM Journal of Experimental Algorithmics, 11, 2006. [doi]

@article{FahleT06,
  title = {A faster branch-and-bound algorithm for the test-cover problem based on set-covering techniques},
  author = {Torsten Fahle and Karsten Tiemann},
  year = {2006},
  doi = {10.1145/1187436.1216579},
  url = {http://doi.acm.org/10.1145/1187436.1216579},
  tags = {rule-based, testing},
  researchr = {https://researchr.org/publication/FahleT06},
  cites = {0},
  citedby = {0},
  journal = {ACM Journal of Experimental Algorithmics},
  volume = {11},
}