\(O((\log n)^{2})\) time online approximation schemes for bin packing and subset sum problems (Q3587356)
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: O(( n)^2) time online approximation schemes for bin packing and subset sum problems |
scientific article; zbMATH DE number 5780414
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | \(O((\log n)^{2})\) time online approximation schemes for bin packing and subset sum problems |
scientific article; zbMATH DE number 5780414 |
Statements
O((logn)2) Time Online Approximation Schemes for Bin Packing and Subset Sum Problems (English)
0 references
7 September 2010
0 references
0.8256880044937134
0 references
0.8053196668624878
0 references
0.8030250668525696
0 references
0.8005653619766235
0 references
