• DocumentCode
    958690
  • Title

    A Way to Find a Lower Bound for the Minimal Solution of the Covering Problem

  • Author

    Du, Min-Wen

  • Author_Institution
    Department of Computer Science, Johns Hopkins University, Baltimore, Md. 21218.
  • Issue
    3
  • fYear
    1972
  • fDate
    3/1/1972 12:00:00 AM
  • Firstpage
    317
  • Lastpage
    318
  • 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;
  • fLanguage
    English
  • Journal_Title
    Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9340
  • Type

    jour

  • DOI
    10.1109/TC.1972.5008958
  • Filename
    5008958
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=958690