An Efficient Algorithm for Finding an Irredundant Set Cover-Reference-Cited by-同舟云学术

An Efficient Algorithm for Finding an Irredundant Set Cover

Published:1974-07 Issue:3 Volume:21 Page:351-355
ISSN:0004-5411
Container-title:Journal of the ACM
language:en
Short-container-title:J. ACM

Author:

Kime Charles R.¹,Batni Ramachendra P.²,Russell Jeffrey D.³

Affiliation:

1. Department of Electrical and Computer Engineering, University of Wisconsin, Madison, Wisconsin

2. Bell Telephone Laboratories, Naperville, IL and University of Wisconsin, Madison, Wisconsin

3. Collins Radio Company, Cedar Rapids, IA and University of Wisconsin, Madison, Wisconsin

Abstract

The set covering problem is considered and an efficient procedure for finding an irredundant cover is presented. For an m × n cover table, the execution time of the procedure is, in the worst case, proportional to 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.

Publisher

Association for Computing Machinery (ACM)

Subject

Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software

Link

https://dl.acm.org/doi/pdf/10.1145/321832.321833

Reference8 articles.

1. methods, uses, computation;BALINSKI M.L.;Manage. Sci.,1965

2. A method for the fast approximate solution of large prime implicant charts;BOWMAN R. M.;IEEE Trans. Computers C-I,1972

3. Weighting method for the determination of the irredundant set of prime implicants. 1EEE Trans;BUSENIK V;Computers C-21,1972

4. An approach for simplifying switching functions by utilizing the cover table representation;DAS S.R;IEEE Trans. Computers C-20,1971

5. A way to find a lower bound for the minimal solution of the covering problem;MIN-WEN;IEEE Trans. Computers C-M,1972

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Unsupervised clustering of file dialects according to monotonic decompositions of mixtures;2023 IEEE Security and Privacy Workshops (SPW);2023-05

2. Scheduling tests for VLSI systems under power constraints;IEEE Transactions on Very Large Scale Integration (VLSI) Systems;1997-06

3. Systems methodology in sociology;International Journal of Systems Science;1977-01

4. Towards Concise Representation for Taxonomies of Epistemic Communities;Lecture Notes in Computer Science