3-\textsc{hitting set} on bounded degree hypergraphs: upper and lower bounds on the kernel size (Q2999343)
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: 3-\textsc{hitting set} on bounded degree hypergraphs: upper and lower bounds on the kernel size |
scientific article; zbMATH DE number 5887548
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | 3-\textsc{hitting set} on bounded degree hypergraphs: upper and lower bounds on the kernel size |
scientific article; zbMATH DE number 5887548 |
Statements
3-hitting set on Bounded Degree Hypergraphs: Upper and Lower Bounds on the Kernel Size (English)
0 references
12 May 2011
0 references
hitting set
0 references
kernel
0 references
upper bounds
0 references
lower bounds
0 references
parameterized complexity
0 references
0.979446530342102
0 references
0.8587531447410583
0 references
0.8491649031639099
0 references
0.8432595729827881
0 references
0.8149543404579163
0 references
