Pages that link to "Item:Q2753537"
From MaRDI portal
The following pages link to An optimal online algorithm for bounded space variable-sized bin packing (Q2753537):
Displaying 16 items.
- An on-line algorithm for variable-sized bin packing (Q582083) (← links)
- Online bin packing with overload cost (Q831684) (← links)
- An asymptotic competitive scheme for online bin packing (Q896124) (← links)
- Bin packing with controllable item sizes (Q1004389) (← links)
- Variable sized online interval coloring with bandwidth (Q1024785) (← links)
- A \(17/10\)-approximation algorithm for \(k\)-bounded space on-line variable-sized bin packing (Q1299865) (← links)
- The optimal absolute ratio for online bin packing (Q1741486) (← links)
- More on batched bin packing (Q1785762) (← links)
- The variable-width strip packing problem (Q2103938) (← links)
- Efficient algorithms for the offline variable sized bin-packing problem (Q2434654) (← links)
- Improved Online Algorithms for 1-Space Bounded 2-Dimensional Bin Packing (Q3060778) (← links)
- All-Around Near-Optimal Solutions for the Online Bin Packing Problem (Q3459910) (← links)
- Improved Space for Bounded-Space, On-Line Bin-Packing (Q4302269) (← links)
- (Q4439453) (← links)
- A 4-space bounded approximation algorithm for online bin packing problem (Q6113869) (← links)
- Tighter bounds for the harmonic bin packing algorithm (Q6586257) (← links)