Improved approximation algorithms for maximum resource bin packing and lazy bin covering problems (Q2379919)
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 5686371
| 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 5686371 |
Statements
Improved approximation algorithms for maximum resource bin packing and lazy bin covering problems (English)
0 references
23 March 2010
0 references
maximum resource bin packing
0 references
lazy bin covering
0 references
approximation algorithms
0 references
pattern
0 references
0.9947715997695924
0 references
0.8984524607658386
0 references
0.892225980758667
0 references
0.8338693976402283
0 references
0.833245038986206
0 references
