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
248
click to vote
WADS
2009
Springer
378
views
Algorithms
»
more
WADS 2009
»
Two for One: Tight Approximation of 2D Bin Packing
15 years 9 months ago
Download
aeolus.ceid.upatras.gr
In this paper, we study the two-dimensional geometrical bin packing problem (2DBP): given a list of rectangles, provide a packing of all these into the smallest possible number of ...
Klaus Jansen, Lars Prädel, Ulrich M. Schwarz
claim paper
Read More »