The minimal hitting set generation problem: algorithms and computation (Q2953406)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6670309
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The minimal hitting set generation problem: algorithms and computation |
scientific article; zbMATH DE number 6670309 |
Statements
The Minimal Hitting Set Generation Problem: Algorithms and Computation (English)
0 references
4 January 2017
0 references
minimal hitting set
0 references
Boolean dualization
0 references
combinatorial algorithms
0 references
hypergraph transversal
0 references
set cover problem
0 references
0 references
0 references
0 references
0 references
0 references
0.773420512676239
0 references
0.762579619884491
0 references
0.7487665414810181
0 references
0.7242182493209839
0 references
