84 search results - page 2 / 17 » Schemes for SR-Tree packing |
SODA
2004
ACM
13 years 6 months ago
2004
ACM
We consider a classic multidimensional generalization of the bin packing problem, namely, packing d-dimensional rectangles into the minimum number of unit cubes. Our two results a...
STOC
2005
ACM
13 years 10 months ago
2005
ACM
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...
WAOA
2007
Springer
13 years 10 months ago
2007
Springer
We continue the study of bin packing with splittable items and cardinality constraints. In this problem, a set of items must be packed into as few bins as possible. Items may be s...
ESA
2005
Springer
13 years 10 months ago
2005
Springer
We study a wide range of online covering and packing optimization problems. In an online covering problem a linear cost function is known in advance, but the linear constraints th...
SAC
2006
ACM
13 years 10 months ago
2006
ACM
Modern database applications like geographic information systems, multimedia databases, and digital libraries dealing with huge volumes of high dimensional data, make use of multi...