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

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

0.00 Avg rating0 Votes
Article ID: iaor19931442
Country: Netherlands
Volume: 41
Issue: 2
Start Page Number: 173
End Page Number: 178
Publication Date: Jan 1993
Journal: Discrete Applied Mathematics
Authors: ,
Keywords: bin packing
Abstract:

In this note the authors present a simplified proof of a lower bound for on-line bin packing. This proof also covers the well-known result given by Liang.

Reviews

Required fields are marked *. Your email address will not be published.