Sciweavers

39 search results - page 3 / 8
» On-line bin Packing with Two Item Sizes
Sort
View
WAOA
2007
Springer
109views Algorithms» more  WAOA 2007»
14 years 3 days 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
IOR
2008
102views more  IOR 2008»
13 years 6 months ago
An Optimization Algorithm for the Ordered Open-End Bin-Packing Problem
The ordered open-end bin packing problem is a variant of the bin packing problem in which the items to be packed are sorted in a given order and the capacity of each bin can be ex...
Alberto Ceselli, Giovanni Righini
ICALP
2005
Springer
13 years 11 months ago
Dynamic Bin Packing of Unit Fractions Items
This paper studies the dynamic bin packing problem, in which items arrive and depart at arbitrary time. We want to pack a sequence of unit fractions items (i.e., items with sizes ...
Wun-Tat Chan, Tak Wah Lam, Prudence W. H. Wong
COCOON
2006
Springer
13 years 9 months ago
The Class Constrained Bin Packing Problem with Applications to Video-on-Demand
In this paper we present approximation results for the class constrained bin packing problem that has applications to Video-on-Demand Systems. In this problem we are given bins of...
E. C. Xavier, Flávio Keidi Miyazawa
TCS
2010
13 years 4 months ago
Class constrained bin packing revisited
We study the following variant of the bin packing problem. We are given a set of items, where each item has a (non-negative) size and a color. We are also given an integer paramet...
Leah Epstein, Csanád Imreh, Asaf Levin