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

DOI10.1016/0166-218X(93)90037-OzbMath0778.68040MaRDI QIDQ1208477

J. B. G. Frenk, Gábor Galambos

Publication date: 16 May 1993

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

lower boundbin packing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial aspects of packing and covering (05B40)

Related Items (5)

Lower bounds for 1-, 2- and 3-dimensional on-line bin packing algorithms ⋮ On-line bin packing ? A restricted survey ⋮ New lower bounds for certain classes of bin packing algorithms ⋮ Online square packing with gravity ⋮ An improved lower bound for on-line bin packing algorithms

Cites Work

• Unnamed Item
• A lower bound for on-line bin packing
• Parametric Lower Bound for On-Line Bin-Packing
• A simple on-line bin-packing algorithm
• New Algorithms for Bin Packing
• A Tight Asymptotic Bound for Next-Fit-Decreasing Bin-Packing

This page was built for publication: A simple proof of Liang's lower bound for on-line bin packing and the extension to the parametric case