Partially dynamic bin packing can be solved within \(1 + \varepsilon\) in (amortized) polylogarithmic time (Q287129): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0020-0190(97)00092-6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1493845713 / rank | |||
Normal rank | |||
Latest revision as of 11:35, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Partially dynamic bin packing can be solved within \(1 + \varepsilon\) in (amortized) polylogarithmic time |
scientific article |
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
