Title :
A Way to Find a Lower Bound for the Minimal Solution of the Covering Problem
Author_Institution :
Department of Computer Science, Johns Hopkins University, Baltimore, Md. 21218.
fDate :
3/1/1972 12:00:00 AM
Abstract :
This correspondence derives a lower bound for the size of a minimal solution of a 0-1 covering problem.
Keywords :
Computer science; Costs; Dynamic programming; Equations; Indium tin oxide; Linear matrix inequalities; Pattern recognition; Velocity measurement; Covering problem; lower bound; minimal solution;
Journal_Title :
Computers, IEEE Transactions on
DOI :
10.1109/TC.1972.5008958
