Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
138
Voted
ISAAC
2010
Springer
221
views
Algorithms
»
more
ISAAC 2010
»
Improved Online Algorithms for 1-Space Bounded 2-Dimensional Bin Packing
15 years 19 days ago
Download
i.cs.hku.hk
In this paper, we study 1-space bounded 2-dimensional bin packing and square packing. A sequence of rectangular items (square items, respectively) arrive over time, which must be packed into square
Yong Zhang, Jing-Chi Chen, Francis Y. L. Chin, Xin
Real-time Traffic
2-dimensional Bin Packing
|
Algorithms
|
ISAAC 2010
|
Square Items
|
Square Packing
|
claim paper
Related Content
»
On Dynamic Bin Packing An Improved Lower Bound and Resource Augmentation Analysis
»
Online Bin Packing with Resource Augmentation
»
Online Interval Coloring with Packing Constraints
more »
Post Info
More Details (n/a)
Added
13 Feb 2011
Updated
13 Feb 2011
Type
Journal
Year
2010
Where
ISAAC
Authors
Yong Zhang, Jing-Chi Chen, Francis Y. L. Chin, Xin Han, Hing-Fung Ting, Yung H. Tsin
Comments
(0)
Researcher Info
Algorithms Study Group
Computer Vision