### An Efficient Algorithm for Finding an Irredundant Set CoverAn Efficient Algorithm for Finding an Irredundant Set Cover

Access Restriction
Subscribed

 Author Kime, Charles R. ♦ Batni, Ramachendra P. ♦ Russell, Jeffrey D. Source ACM Digital Library Content type Text Publisher Association for Computing Machinery (ACM) File Format PDF Copyright Year ©1974 Language English
 Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science Abstract The set covering problem is considered and an efficient procedure for finding an irredundant cover is presented. For an $\textit{m}$ × $\textit{n}$ cover table, the execution time of the procedure is, in the worst case, proportional to $\textit{mn}.$ Methods are suggested for obtaining alternate irredundant covers based on an initially obtained irredundant cover. The basic cost-independent algorithm is heuristically extended to consider costs so that a reduced-cost irredundant cover can be obtained. A summary of some computational experience is presented, which indicates that the procedure is fast and applicable to large problems. ISSN 00045411 Age Range 18 to 22 years ♦ above 22 year Educational Use Research Education Level UG and PG Learning Resource Type Article Publisher Date 1974-07-01 Publisher Place New York e-ISSN 1557735X Journal Journal of the ACM (JACM) Volume Number 21 Issue Number 3 Page Count 5 Starting Page 351 Ending Page 355

#### Open content in new tab

Source: ACM Digital Library