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

  • Authors:

  • Min-Wen Du

  • Affiliations:

  • Department of Computer Science, Johns Hopkins University, Baltimore, Md. 21218.

  • Venue:
  • IEEE Transactions on Computers
  • Year:
  • 1972

Quantified Score

Hi-index 14.98

Visualization

Abstract

This correspondence derives a lower bound for the size of a minimal solution of a 0-1 covering problem.