On the Size of Systems of Sets Every <i>t</i> of which Have an SDR, with an Application to the Worst-Case Ratio of Heuristics for Packing Problems (Q3360178)
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 4212042
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the Size of Systems of Sets Every <i>t</i> of which Have an SDR, with an Application to the Worst-Case Ratio of Heuristics for Packing Problems |
scientific article; zbMATH DE number 4212042 |
Statements
On the Size of Systems of Sets Every <i>t</i> of which Have an SDR, with an Application to the Worst-Case Ratio of Heuristics for Packing Problems (English)
0 references
1989
0 references
subsets
0 references
system of distinct representatives
0 references
SDR
0 references
worst-case ratio
0 references
maximum collection of pairwise disjoint sets
0 references
0.7788164615631104
0 references
0.7745954990386963
0 references
0.765427827835083
0 references
0.7635289430618286
0 references
