Sciweavers

84 search results - page 2 / 17
» Schemes for SR-Tree packing
Sort
View
SODA
2004
ACM
203views Algorithms» more  SODA 2004»
14 years 3 days ago
Approximation schemes for multidimensional packing
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...
José R. Correa, Claire Kenyon
STOC
2005
ACM
143views Algorithms» more  STOC 2005»
14 years 4 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
WAOA
2007
Springer
109views Algorithms» more  WAOA 2007»
14 years 4 months ago
Approximation Schemes for Packing Splittable Items with Cardinality Constraints
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...
Leah Epstein, Rob van Stee
ESA
2005
Springer
125views Algorithms» more  ESA 2005»
14 years 4 months ago
Online Primal-Dual Algorithms for Covering and Packing Problems
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...
Niv Buchbinder, Joseph Naor
SAC
2006
ACM
14 years 4 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