✦ LIBER ✦

Algorithms for the Relaxed Online Bin-Packing Model

✍ Scribed by Gambosi, Giorgio; Postiglione, Alberto; Talamo, Maurizio

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

Online algorithms for a dual version of

✍ J. Csirik; V. Totik 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 386 KB

A class of simple stochastic online bin

✍ U. Hoffmann 📂 Article 📅 1982 🏛 Springer Vienna 🌐 English ⚖ 428 KB

Parallel approximation algorithms for bi

✍ Richard J. Anderson; Ernst W. Mayr; Manfred K. Warmuth 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 1019 KB

Approximation Algorithms for Extensible

✍ E. G. Coffman; George S. Lueker 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 67 KB

An Optimal Online Algorithm for Bounded

✍ Seiden, Steven S. 📂 Article 📅 2001 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 446 KB