Online algorithms for 1-space bounded 2-dimensional bin packing and square packing
DOI10.1016/J.TCS.2014.02.045zbMATH Open1360.68911OpenAlexW2061918649MaRDI QIDQ744097FDOQ744097
Hing-Fung Ting, Deshi Ye, Yong Zhang, Yung H. Tsin, Chung Keung Poon, Xin Han, Francis Y. L. Chin
Publication date: 6 October 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2014.02.045
Recommendations
- Online algorithms for 1-space bounded 2-dimensional bin packing and square packing
- Improved Online Algorithms for 1-Space Bounded 2-Dimensional Bin Packing
- 1-bounded space algorithms for 2-dimensional bin packing
- One-space bounded algorithms for two-dimensional bin packing
- On-line algorithms for 2-space bounded 2-dimensional bin packing
Online algorithms; streaming algorithms (68W27) Analysis of algorithms (68W40) Combinatorial optimization (90C27)
Cites Work
- On the online bin packing problem
- A simple on-line bin-packing algorithm
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
- An improved lower bound for on-line bin packing algorithms
- A new upper bound 2.5545 on 2D Online Bin Packing
- New Algorithms for Bin Packing
- On-line grid-packing with a single active grid
- On-line packing sequences of cubes in the unit cube
- Improved Online Algorithms for 1-Space Bounded 2-Dimensional Bin Packing
- Bounded space on-line bin packing: Best is better than first
- Optimal Online Algorithms for Multidimensional Packing Problems
- Online Algorithm for 1-Space Bounded Multi-dimensional Bin Packing
- 1-bounded space algorithms for 2-dimensional bin packing
- Title not available (Why is that?)
Cited In (11)
- Drawer algorithms for 1-space bounded multidimensional hyperbox packing
- Improved Online Algorithms for 1-Space Bounded 2-Dimensional Bin Packing
- Improved Online Algorithms for 2-Space Bounded 2-Dimensional Bin Packing
- Online algorithms for a dual version of bin packing
- Title not available (Why is that?)
- An asymptotic competitive scheme for online bin packing
- 1-bounded space algorithms for 2-dimensional bin packing
- A 4-space bounded approximation algorithm for online bin packing problem
- Online Bin Packing with (1,1) and (2,R) Bins
- Efficient 1-space bounded hypercube packing algorithm
- A note on one-space bounded square packing
This page was built for publication: Online algorithms for 1-space bounded 2-dimensional bin packing and square packing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q744097)
