VOLUME 10 | 2005 | NUMBERS 5–6 |
The Complexity of the Minimum k-cover Problem
Pages 641–653
Download Abstract
Fulltext is accessible with your personal account
ShowHide BibTeX
BibTeX:
@article{JALC-2005-641, author = {Richard Cole and Costas S. Iliopoulos and Manal Mohamed and W. F. Smyth and Lu Yang}, title = {The Complexity of the Minimum $k$-cover Problem}, journal = {Journal of Automata, Languages and Combinatorics}, volume = {10}, number = {5--6}, pages = {641--653}, year = {2005}, url = {https://doi.org/10.25596/jalc-2005-641}, doi = {10.25596/jalc-2005-641} }