✦ LIBER ✦

Besk-k-Fit bin packing

✍ Scribed by W. Mao

Book ID: 105509865
Publisher: Springer Vienna
Year: 1993
Tongue: English
Weight: 296 KB
Volume: 50
Category: Article
ISSN: 0010-485X
DOI: 10.1007/bf02243816

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Tight Worst-Case Performance Bounds for

Tight Worst-Case Performance Bounds for Next- k -Fit Bin Packing

✍ Mao, Weizhen 📂 Article 📅 1993 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 960 KB

Average-case analyses of first fit and r

Average-case analyses of first fit and random fit bin packing

✍ Susanne Albers; Michael Mitzenmacher 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 202 KB

We prove that the First Fit bin packing algorithm is stable under the input distribution U k -2 k for all k ≥ 3, settling an open question from the recent survey by Coffman, Garey, and Johnson ["Approximation algorithms for bin backing: A survey," Approximation algorithms for NP-hard problems, D. Ho

Tight absolute bound for First Fit Decre

Tight absolute bound for First Fit Decreasing bin-packing:

✍ Dósa, György; Li, Rongheng; Han, Xin; Tuza, Zsolt 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 753 KB

A probabilistic analysis of the Next-Fit

A probabilistic analysis of the Next-Fit bin packing algorithm

✍ Micha Hofri 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 412 KB

A Tight Asymptotic Bound for Next-Fit-De

A Tight Asymptotic Bound for Next-Fit-Decreasing Bin-Packing

✍ Baker, B. S.; Coffman, Jr., E. G. 📂 Article 📅 1981 🏛 Society for Industrial and Applied Mathematics ⚖ 596 KB

Probabilistic analysis of the next fit d

Probabilistic analysis of the next fit decreasing algorithm for bin-packing

✍ WanSoo T. Rhee 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 225 KB