Optimal covering designs: complexity results and new bounds

Pilu Crescenzi, Federico Montecalvo, Gianluca Rossi. Optimal covering designs: complexity results and new bounds. Discrete Applied Mathematics, 144(3):281-290, 2004. [doi]

@article{CrescenziMR04,
  title = {Optimal covering designs: complexity results and new bounds},
  author = {Pilu Crescenzi and Federico Montecalvo and Gianluca Rossi},
  year = {2004},
  doi = {10.1016/j.dam.2003.11.006},
  url = {http://dx.doi.org/10.1016/j.dam.2003.11.006},
  researchr = {https://researchr.org/publication/CrescenziMR04},
  cites = {0},
  citedby = {0},
  journal = {Discrete Applied Mathematics},
  volume = {144},
  number = {3},
  pages = {281-290},
}