✦ 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
DOI: 10.1016/0890-5401(89)90003-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Approximation Algorithms for Extensible

Approximation Algorithms for Extensible Bin Packing

✍ E. G. Coffman; George S. Lueker 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 67 KB

Heuristic evaluation techniques for bin

Heuristic evaluation techniques for bin packing approximation algorithms

✍ A. Aiello; E. Burattini; A. Massarotti; F. Ventriglia 📂 Article 📅 1985 🏛 Springer Milan 🌐 English ⚖ 637 KB

“A posteriori” evaluation of bin packing

“A posteriori” evaluation of bin packing approximation algorithms

✍ A. Aiello; E. Burattini; A. Massarotti; F. Ventriglia 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 379 KB

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

Approximation algorithms for the oriente

Approximation algorithms for the oriented two-dimensional bin packing problem

✍ Andrea Lodi; Silvano Martello; Daniele Vigo 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 135 KB

Improved Approximation Algorithms for Ma

Improved Approximation Algorithms for Maximum Resource Bin Packing and Lazy Bin Covering Problems

✍ Mingen Lin; Yang Yang; Jinhui Xu 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 430 KB