Offline and online algorithms for single-minded selling problem (Q2173298)
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 7191862
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Offline and online algorithms for single-minded selling problem |
scientific article; zbMATH DE number 7191862 |
Statements
Offline and online algorithms for single-minded selling problem (English)
0 references
22 April 2020
0 references
NP-hardness
0 references
approximation ratio
0 references
competitive ratio
0 references
single-minded selling
0 references
0 references
0 references
0.964063823223114
0 references
0.8509529829025269
0 references
0.8281864523887634
0 references
0.8192203640937805
0 references
0.7968963980674744
0 references
