An algorithm to find the smallest committee containing a given set (Q1080373)
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 algorithm to find the smallest committee containing a given set |
scientific article; zbMATH DE number 3965862
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm to find the smallest committee containing a given set |
scientific article; zbMATH DE number 3965862 |
Statements
An algorithm to find the smallest committee containing a given set (English)
0 references
1986
0 references
Let N be a finite set and T a nonempty subset of N. The paper proposes an algorithm to find the smallest committee containing T. This algorithm is a modification of a previous one proposed by \textit{L. J. Billera} [J. Comb. Theory B 11, 234-245 (1971; Zbl 0219.90068)].
0 references
simple game
0 references
clutter
0 references
smallest committee
0 references
algorithm
0 references
