Sciweavers

64 search results - page 2 / 13
» Bin Packing with Fixed Number of Bins Revisited
Sort
View
APPROX
2009
Springer
177views Algorithms» more  APPROX 2009»
14 years 1 months ago
Improved Absolute Approximation Ratios for Two-Dimensional Packing Problems
Abstract. We consider the two-dimensional bin packing and strip packing problem, where a list of rectangles has to be packed into a minimal number of rectangular bins or a strip of...
Rolf Harren, Rob van Stee
CORR
2010
Springer
157views Education» more  CORR 2010»
13 years 7 months ago
A Dense Hierarchy of Sublinear Time Approximation Schemes for Bin Packing
The bin packing problem is to find the minimum number of bins of size one to pack a list of items with sizes a1,
Richard Beigel, Bin Fu
ESA
1993
Springer
140views Algorithms» more  ESA 1993»
13 years 11 months ago
Fully Dynamic Algorithms for Bin Packing: Being (mostly) Myopic Helps
The problem of maintaining an approximate solution for one-dimensional bin packing when items may arrive and depart dynamically is studied. In accordance with various work on fully...
Zoran Ivkovic, Errol L. Lloyd
CPAIOR
2010
Springer
13 years 12 months ago
Consistency Check for the Bin Packing Constraint Revisited
Julien Dupuis, Pierre Schaus, Yves Deville