A simple proof of Liang's lower bound for on-line bin packing and the extension to the parametric case

Preprint
Publisher Website
Google Scholar
    • preprint
      • Published in RePEc
Abstract
In this note we present a simplified proof of a lower bound for on-line bin packing. This proof also covers the well-known result given by Liang in Inform. Process Lett. 10 (1980) 76–79.
All Related Versions

This publication has 0 references indexed in Scilit: