3-hitting set on bounded degree hypergraphs: upper and lower bounds on the kernel size (Q5261045)
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 6454682
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | 3-hitting set on bounded degree hypergraphs: upper and lower bounds on the kernel size |
scientific article; zbMATH DE number 6454682 |
Statements
3-Hitting set on bounded degree hypergraphs: Upper and lower bounds on the kernel size (English)
0 references
1 July 2015
0 references
hitting set
0 references
kernel
0 references
upper bounds
0 references
lower bounds
0 references
parameterized complexity
0 references
0 references
0 references
0.979446530342102
0 references
0.8627771139144897
0 references
0.8340387344360352
0 references
0.8321830630302429
0 references
