Pages that link to "Item:Q1208477"
From MaRDI portal
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 5 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)
- On-line bin packing ? A restricted survey (Q4845093) (← links)