Sciweavers

50 search results - page 3 / 10
» Approximation schemes for multidimensional packing
Sort
View
STOC
2005
ACM
143views Algorithms» more  STOC 2005»
13 years 11 months ago
On strip packing With rotations
We present an asymptotic fully polynomial time approximation scheme for two-dimensional strip packing with rotations. In this problem, a set of rectangles need to be packed into a...
Klaus Jansen, Rob van Stee
SAC
2006
ACM
13 years 12 months ago
Schemes for SR-Tree packing
Modern database applications like geographic information systems, multimedia databases, and digital libraries dealing with huge volumes of high dimensional data, make use of multi...
Jayendra Venkateswaran, S. R. Subramanya
GLOBECOM
2009
IEEE
14 years 24 days ago
Iteratively Detected Three-Stage Multi-Dimensional Sphere Packing Modulation Aided Multi-Functional MIMO
Abstract— This paper presents a novel multi-functional MultipleInput Multiple-Output (MIMO) scheme that combines the benefits of the Vertical Bell Labs Layered Space-Time (V-BLA...
Mohammed El-Hajjar, Osamah Alamri, Lajos Hanzo
ALGORITHMICA
2004
125views more  ALGORITHMICA 2004»
13 years 6 months ago
Multidimensional Cube Packing
We consider the d-dimensional cube packing problem (d-CPP): given a list L of d-dimensional cubes and (an unlimited quantity of) d-dimensional unit-capacity cubes, called bins, fi...
Yoshiharu Kohayakawa, Flávio Keidi Miyazawa...
ESCAPE
2007
Springer
256views Algorithms» more  ESCAPE 2007»
14 years 6 days ago
A Fast Asymptotic Approximation Scheme for Bin Packing with Rejection
Wolfgang W. Bein, José R. Correa, Xin Han