𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Parallel approximation algorithms for bin packing

✍ Scribed by Richard J. Anderson; Ernst W. Mayr; Manfred K. Warmuth


Book ID
113383890
Publisher
Elsevier Science
Year
1989
Tongue
English
Weight
1019 KB
Volume
82
Category
Article
ISSN
0890-5401

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


A 1312 approximation algorithm for bin p
✍ 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