Dual-bounded generating problems: Weighted transversals of a hypergraph (Q1878396)
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: Dual-bounded generating problems: Weighted transversals of a hypergraph |
scientific article; zbMATH DE number 2093404
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Dual-bounded generating problems: Weighted transversals of a hypergraph |
scientific article; zbMATH DE number 2093404 |
Statements
Dual-bounded generating problems: Weighted transversals of a hypergraph (English)
0 references
19 August 2004
0 references
Boolean programming
0 references
Data mining
0 references
Dualization
0 references
Dual hypergraph
0 references
Incremental
0 references
polynomial time
0 references
Intersection inequalities
0 references
Minimal infrequent set
0 references
Maximal frequent set
0 references
Multiple transversal
0 references
Partial transversal
0 references
Threshold Boolean function
0 references
0 references
0 references
0 references
0 references
0 references
0.9185868501663208
0 references
0.8360777497291565
0 references
0.807500422000885
0 references
0.8008961081504822
0 references
