The Community for Technology Leaders
RSS Icon
Issue No.03 - March (1972 vol.21)
pp: 317-318
Min-Wen Du , Department of Computer Science, Johns Hopkins University, Baltimore, Md. 21218.
This correspondence derives a lower bound for the size of a minimal solution of a 0-1 covering problem.
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
37 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool