✦ LIBER ✦

Tight performance bound ofAFBkbin packing

✍ Scribed by Guochuan Zhang; Minyi Yue

Book ID: 105434240
Publisher: Institute of Applied Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year: 1997
Tongue: English
Weight: 175 KB
Volume: 13
Category: Article
ISSN: 0168-9673
DOI: 10.1007/bf02009554

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Tight Worst-Case Performance Bounds for

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

A tight lower bound for optimal bin pack

✍ Heng-Yi Chao; Mary P. Harper; Russell W. Quong 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 439 KB

A Tight Asymptotic Bound for Next-Fit-De

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

A Strip-Packing Algorithm with Absolute

✍ Steinberg, A. 📂 Article 📅 1997 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 275 KB

Tight Performance Bounds of CP-Schedulin

✍ Nodari Vakhania 📂 Article 📅 2001 🏛 Springer US 🌐 English ⚖ 381 KB

Bin packing with discrete item sizes, pa

✍ E. G. Coffman Jr.; D. S. Johnson; P. W. Shor; R. R. Weber 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 378 KB

⌰ n log k when k s o n and ⌰ n log n the bound for the continuous uni-. Ž . form case when k s ⍀ n .