A 13/12 approximation algorithm for bin packing with extendable bins (Q293250): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3347319 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Bounds on Multiprocessing Timing Anomalies / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On-line approximation algorithms for scheduling tasks on identical machines with extendable working time / rank | |||
Normal rank | |||
Latest revision as of 03:37, 12 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A 13/12 approximation algorithm for bin packing with extendable bins |
scientific article |
Statements
A 13/12 approximation algorithm for bin packing with extendable bins (English)
0 references
9 June 2016
0 references
bin packing
0 references
scheduling
0 references
approximation algorithms
0 references
worst-case performance
0 references
