Pages that link to "Item:Q5918310"
From MaRDI portal
The following pages link to A new lower bound for classic online bin packing (Q5918310):
Displaying 21 items.
- Semi-on-line bin packing: a short overview and a new lower bound (Q301113) (← links)
- New lower bounds for certain classes of bin packing algorithms (Q441876) (← links)
- Improved lower bounds for semi-online bin packing problems (Q1014344) (← links)
- An improved lower bound for on-line bin packing algorithms (Q1199958) (← links)
- A simple proof of Liang's lower bound for on-line bin packing and the extension to the parametric case (Q1208477) (← links)
- More on ordered open end bin packing (Q2066681) (← links)
- Comparing the costs of any fit algorithms for bin packing (Q2102827) (← links)
- Lower bounds on the performance of online algorithms for relaxed packing problems (Q2169944) (← links)
- Open-end bin packing: new and old analysis approaches (Q2172402) (← links)
- A new lower bound on the price of anarchy of selfish bin packing (Q2274500) (← links)
- Improved lower bounds for the online bin stretching problem (Q2399609) (← links)
- New Lower Bounds for Certain Classes of Bin Packing Algorithms (Q3075446) (← links)
- A new upper bound 2.5545 on 2D Online Bin Packing (Q3189035) (← links)
- Parametric Lower Bound for On-Line Bin-Packing (Q3724089) (← links)
- Lower bounds for several online variants of bin packing (Q5915655) (← links)
- Several methods of analysis for cardinality constrained bin packing (Q5918534) (← links)
- A new lower bound for classic online bin packing (Q5918895) (← links)
- Several methods of analysis for cardinality constrained bin packing (Q5970788) (← links)
- A 4-space bounded approximation algorithm for online bin packing problem (Q6113869) (← links)
- Online computation with untrusted advice (Q6564618) (← links)
- Tighter bounds for the harmonic bin packing algorithm (Q6586257) (← links)
