𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Approximation Algorithms for Extensible Bin Packing

✍ Scribed by E. G. Coffman; George S. Lueker

Publisher
Springer US
Year
2006
Tongue
English
Weight
67 KB
Volume
9
Category
Article
ISSN
1094-6136

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A 1312 approximation algorithm for bin p
A 1312 approximation algorithm for bin packing with extendable bins
✍ Paolo Dell'Olmo; Hans Kellerer; Maria Grazia Speranza; Zsolt Tuza πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 430 KB

A set of items has to be assigned to a set of bins with size one. If necessary, the size of the bins can be extended. The objective is to minimize the total size, i.e., the sum of the sizes of the bins. The Longest Processing Time heuristic is applied to this NP-hard problem. For this approximation

A 3-approximation algorithm for two-dime
A 3-approximation algorithm for two-dimensional bin packing
✍ Guochuan Zhang πŸ“‚ Article πŸ“… 2005 πŸ› Elsevier Science 🌐 English βš– 189 KB

In the classical two-dimensional bin packing problem one is asked to pack a set of rectangular items, without overlap and without any rotation, into the minimum number of identical square bins. We give an approximation algorithm with absolute worst-case ratio of 3.