Pages that link to "Item:Q1591548"
From MaRDI portal
The following pages link to Linear time-approximation algorithms for bin packing (Q1591548):
Displaying 14 items.
- Bin packing with rejection revisited (Q848845) (← links)
- A sublinear-time approximation scheme for bin packing (Q1034628) (← links)
- A linear time bin-packing algorithm (Q1062626) (← links)
- A linear approximation algorithm for bin packing with absolute approximation factor \(\frac {3}{2}\) (Q1400475) (← links)
- Efficient algorithms for real-life instances of the variable size bin packing problem (Q1761234) (← links)
- A 5/4 linear time bin packing algorithm (Q1975969) (← links)
- Bin packing with divisible item sizes and rejection penalties (Q2136894) (← links)
- NF-based algorithms for online bin packing with buffer and bounded item size (Q2355990) (← links)
- A 3-approximation algorithm for two-dimensional bin packing (Q2488211) (← links)
- NF-Based Algorithms for Online Bin Packing with Buffer and Item Size Limitation (Q2867105) (← links)
- (Q3787789) (← links)
- Linear Time Algorithms for Knapsack Problems with Bounded Weights (Q4939603) (← links)
- A 4-space bounded approximation algorithm for online bin packing problem (Q6113869) (← links)
- Tighter bounds for the harmonic bin packing algorithm (Q6586257) (← links)