✦ LIBER ✦

Does randomization help in on-line bin packing?

✍ Scribed by Barun Chandra

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 343 KB
Volume: 43
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(92)90023-o

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An on-line algorithm for variable-sized

An on-line algorithm for variable-sized bin packing

✍ J. Csirik 📂 Article 📅 1989 🏛 Springer-Verlag 🌐 English ⚖ 462 KB

Multidimensional on-line bin packing: Al

Multidimensional on-line bin packing: Algorithms and worst-case analysis

✍ Don Coppersmith; Prabhakar Raghavan 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 251 KB

A new version of on-line variable-sized

A new version of on-line variable-sized bin packing

✍ Guochuan Zhang 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 304 KB

This paper investigates a new version of the on-line variable-sized bin packing problem. Suppose that bin capacities can vary. Given a list of items, the goal is to pack items in the bins which arrive in an on-line way such that the total size of bins used is minimized. It is shown that next fit and

Repacking helps in bounded space on-line

Repacking helps in bounded space on-line bind-packing

✍ G. Galambos; G. J. Woeginger 📂 Article 📅 1993 🏛 Springer Vienna 🌐 English ⚖ 501 KB

Lower bounds for 1-, 2- and 3-dimensiona

Lower bounds for 1-, 2- and 3-dimensional on-line bin packing algorithms

✍ G. Galambos; A. Vliet 📂 Article 📅 1994 🏛 Springer Vienna 🌐 English ⚖ 664 KB

On the power of randomization in on-line

On the power of randomization in on-line algorithms

✍ S. Ben-David; A. Borodin; R. Karp; G. Tardos; A. Wigderson 📂 Article 📅 1994 🏛 Springer 🌐 English ⚖ 797 KB