Pages that link to "Item:Q1208477"

The following pages link to A simple proof of Liang's lower bound for on-line bin packing and the extension to the parametric case (Q1208477):

Displaying 7 items.

• New lower bounds for certain classes of bin packing algorithms (Q441876) (← links)
• Online square packing with gravity (Q476449) (← links)
• An improved lower bound for on-line bin packing algorithms (Q1199958) (← links)
• Lower bounds for 1-, 2- and 3-dimensional on-line bin packing algorithms (Q1332349) (← links)
• A simple proof of the inequality \(MFFD(L)\leq {71\over 60}\text{OPT}(L)+1,L\) for the \(MFFD\) bin-packing algorithm (Q1916508) (← links)
• Parametric Lower Bound for On-Line Bin-Packing (Q3724089) (← links)
• On-line bin packing ? A restricted survey (Q4845093) (← links)