|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
A Way to Find a Lower Bound for the Minimal Solution of the Covering Problem
March 1972 (vol. 21 no. 3)
pp. 317-318
| ASCII Text | x | ||
| Min-Wen Du, "A Way to Find a Lower Bound for the Minimal Solution of the Covering Problem," IEEE Transactions on Computers, vol. 21, no. 3, pp. 317-318, March, 1972. | |||
| BibTex | x | ||
| @article{ 10.1109/TC.1972.5008958, author = {Min-Wen Du}, title = {A Way to Find a Lower Bound for the Minimal Solution of the Covering Problem}, journal ={IEEE Transactions on Computers}, volume = {21}, number = {3}, issn = {0018-9340}, year = {1972}, pages = {317-318}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.1972.5008958}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - A Way to Find a Lower Bound for the Minimal Solution of the Covering Problem IS - 3 SN - 0018-9340 SP317 EP318 EPD - 317-318 A1 - Min-Wen Du, PY - 1972 VL - 21 JA - IEEE Transactions on Computers ER - | |||
This correspondence derives a lower bound for the size of a minimal solution of a 0-1 covering problem.
Citation:
Min-Wen Du, "A Way to Find a Lower Bound for the Minimal Solution of the Covering Problem," IEEE Transactions on Computers, vol. 21, no. 3, pp. 317-318, March 1972, doi:10.1109/TC.1972.5008958
Usage of this product signifies your acceptance of the Terms of Use.