Improved Approximation Algorithms for Maximum Resource Bin Packing and Lazy Bin Covering Problems (Q5459151)
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 Approximation Algorithms for Maximum Resource Bin Packing and Lazy Bin Covering Problems |
scientific article; zbMATH DE number 5267622
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Improved Approximation Algorithms for Maximum Resource Bin Packing and Lazy Bin Covering Problems |
scientific article; zbMATH DE number 5267622 |
Statements
Improved Approximation Algorithms for Maximum Resource Bin Packing and Lazy Bin Covering Problems (English)
0 references
24 April 2008
0 references
0.9947715997695924
0 references
0.9059421420097352
0 references
0.8994706869125366
0 references
0.8360307812690735
0 references
0.8353249430656433
0 references
