A top-down approach to search-trees: Improved algorithmics for 3-hitting set (Q848640)
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: A top-down approach to search-trees: Improved algorithmics for 3-hitting set |
scientific article; zbMATH DE number 5677430
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A top-down approach to search-trees: Improved algorithmics for 3-hitting set |
scientific article; zbMATH DE number 5677430 |
Statements
A top-down approach to search-trees: Improved algorithmics for 3-hitting set (English)
0 references
4 March 2010
0 references
Hitting set
0 references
Parametrized algorithms
0 references
0 references
0.8345977663993835
0 references
0.8204256892204285
0 references
0.8084906935691833
0 references
0.7957412600517273
0 references
0.7907371520996094
0 references
