An O(m n) algorithm for regular set-covering problems (Q1095668)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An O(m n) algorithm for regular set-covering problems |
scientific article; zbMATH DE number 4028924
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An O(m n) algorithm for regular set-covering problems |
scientific article; zbMATH DE number 4028924 |
Statements
An O(m n) algorithm for regular set-covering problems (English)
0 references
1987
0 references
A new algorithm for solving the optimal set-covering problem is established for the particular case of regular sets [\textit{P. L. Hammer}, \textit{U. N. Peled} and \textit{M. A. Pollatschek}, IEEE Trans. Comput. C-28, 238-243 (1979; Zbl 0394.94036)]. It is proved that the complexity of this algorithm is O(m n), where m is the number of elements in the given collection of subsets of the set \(\{x_ 1,x_ 2,...,x_ n\}\).
0 references
regular switching functions
0 references
threshold synthesis
0 references
clutters
0 references
polynomial algorithms. optimal set-covering problem
0 references
regular sets
0 references
0.8314812183380127
0 references
0.8028168082237244
0 references
0.8019611835479736
0 references
0.7994682192802429
0 references
