Improved worst-case complexity for the MIN 3-SET COVERING problem (Q2643796)
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: Improved worst-case complexity for the MIN 3-SET COVERING problem |
scientific article; zbMATH DE number 5183110
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Improved worst-case complexity for the MIN 3-SET COVERING problem |
scientific article; zbMATH DE number 5183110 |
Statements
Improved worst-case complexity for the MIN 3-SET COVERING problem (English)
0 references
27 August 2007
0 references
worst-case complexity
0 references
exact algorithm
0 references
MIN SET COVERING
0 references
0.8006810545921326
0 references
0.7996990084648132
0 references
0.7900079488754272
0 references
0.7779393196105957
0 references
