Partially dynamic bin packing can be solved within \(1 + \varepsilon\) in (amortized) polylogarithmic time (Q287129)
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: Partially dynamic bin packing can be solved within 1 + in (amortized) polylogarithmic time |
scientific article; zbMATH DE number 6585440
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Partially dynamic bin packing can be solved within \(1 + \varepsilon\) in (amortized) polylogarithmic time |
scientific article; zbMATH DE number 6585440 |
Statements
Partially dynamic bin packing can be solved within \(1 + \varepsilon\) in (amortized) polylogarithmic time (English)
0 references
26 May 2016
0 references
bin packing
0 references
computational complexity
0 references
0.87144256
0 references
0.8662607
0 references
0.8614791
0 references
0.8614791
0 references
0.86004245
0 references
0 references
0.85786974
0 references
0.85437465
0 references
