Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

WAOA
2004
Springer

favoriteEmaildiscussreport

142views Algorithms» more WAOA 2004»

This Side Up!

13 years 10 months ago

Download math.haifa.ac.il

Abstract. We consider two- and three-dimensional bin packing problems where 90◦ rotations are allowed. We improve all known asymptotic performance bounds for these problems. In particular, we show how to combine ideas from strip packing and two-dimensional bin packing to give a new algorithm for the three-dimensional strip packing problem where boxes can only be rotated sideways. We propose to call this problem ‘This side up’. Our algorithm has an asymptotic performance bound of 9/4.

Leah Epstein, Rob van Stee

Real-time Traffic

Asymptotic Performance Bound | Bin Packing | Packing Problem | WAOA 2004 |

claim paper

Related Content

» Masking with Randomized Look Up Tables Towards Preventing SideChannel Attacks of All Orde...

» Extended Multi BottomUp Tree Transducers

» Setting up a Secure Web Server and Clients on an Intranet

» Acoustic SideChannel Attacks on Printers

» Agentbased control for decentralised demand side management in the smart grid

» Exploration of a Two Sided Rendezvous Search Problem Using Genetic Algorithms

» MeshBased MotionCompensated Interpolation for Side Information Extraction in Distributed V...

» Piecewisestationary bandit problems with side observations

» Protecting Web Servers from Security Holes in ServerSide Includes

Post Info
More Details (n/a)

Added	02 Jul 2010
Updated	02 Jul 2010
Type	Conference
Year	2004
Where	WAOA
Authors	Leah Epstein, Rob van Stee

Comments (0)