✦ LIBER ✦

A note on online strip packing

✍ Scribed by Deshi Ye; Xin Han; Guochuan Zhang

Book ID: 106407184
Publisher: Springer US
Year: 2008
Tongue: English
Weight: 240 KB
Volume: 17
Category: Article
ISSN: 1382-6905
DOI: 10.1007/s10878-007-9125-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on online hypercube packing

✍ Xin Han; Deshi Ye; Yong Zhou 📂 Article 📅 2009 🏛 Springer-Verlag 🌐 English ⚖ 457 KB

A note on the Kenyon–Remila strip-packin

A note on the Kenyon–Remila strip-packing algorithm

✍ Maxim Sviridenko 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 119 KB

Improved online algorithms for parallel

Improved online algorithms for parallel job scheduling and strip packing

✍ J.L. Hurink; J.J. Paulus 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 341 KB

Packing rectangles in a strip

✍ E.G. Coffman, Jr.; Peter J. Downey; Peter Winkler 📂 Article 📅 2002 🏛 Springer-Verlag 🌐 English ⚖ 135 KB

Shelf algorithms for on-line strip packi

Shelf algorithms for on-line strip packing

✍ János Csirik; Gerhard J. Woeginger 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 461 KB

In the strip packing problem, the goal is to pack a set of rectangles into a vertical strip of unit width so as to minimize the total height of the strip needed. For the on-line version of this problem, Baker and Schwarz introduced the class of so-called shelf algorithms. One of these shelf algorith

A Note on Noun Stripping

✍ Kenneth L. Miner 📂 Article 📅 1989 🏛 University of Chicago Press 🌐 English ⚖ 92 KB