✦ LIBER ✦

Optimal Online Algorithms for Multidimensional Packing Problems

✍ Scribed by Epstein, Leah; van Stee, Rob

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Comparing online algorithms for bin pack

✍ Leah Epstein; Lene M. Favrholdt; Jens S. Kohrt 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 415 KB

On Multidimensional Packing Problems

✍ Chekuri, Chandra; Khanna, Sanjeev 📂 Article 📅 2004 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 202 KB

Algorithms for packing and scheduling pr

✍ Michele Monaci 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 37 KB

Preemptive Online Scheduling: Optimal Al

✍ Tomáš Ebenlendr; Wojciech Jawor; Jiří Sgall 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 425 KB

New Algorithms for Optimal Online Checkp

✍ Stumm, Philipp; Walther, Andrea 📂 Article 📅 2010 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 316 KB

Algorithms for the Relaxed Online Bin-Pa

✍ Gambosi, Giorgio; Postiglione, Alberto; Talamo, Maurizio 📂 Article 📅 2000 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 230 KB