The following pages link to (Q5111695):
Displaying 10 items.
- The tight asymptotic approximation ratio of first fit for bin packing with cardinality constraints (Q1635504) (← links)
- Colored bin packing: online algorithms and lower bounds (Q1702125) (← links)
- Online bin packing with cardinality constraints resolved (Q2186811) (← links)
- Lower bounds for online bin covering-type problems (Q2304119) (← links)
- A lower bound for online rectangle packing (Q2331592) (← links)
- Online bin packing with arbitrary release times (Q2474079) (← links)
- Bounds for online bin packing with cardinality constraints (Q2629856) (← links)
- All-Around Near-Optimal Solutions for the Online Bin Packing Problem (Q3459910) (← links)
- Algorithms – ESA 2005 (Q5475869) (← links)
- Lower bounds for several online variants of bin packing (Q5915655) (← links)