Bin packing with fixed number of bins revisited
نویسندگان
چکیده
منابع مشابه
Bin Packing with Fixed Number of Bins Revisited
As Bin Packing is NP-hard already for k = 2 bins, it is unlikely to be solvable in polynomial time even if the number of bins is a fixed constant. However, if the sizes of the items are polynomially bounded integers, then the problem can be solved in time n for an input of length n by dynamic programming. We show, by proving the W[1]-hardness of Unary Bin Packing (where the sizes are given in u...
متن کاملOnline bin packing with cardinality constraints revisited
Bin packing with cardinality constraints is a bin packing problem where an upper bound k ≥ 2 on the number of items packed into each bin is given, in addition to the standard constraint on the total size of items packed into a bin. We study the online scenario where items are presented one by one. We analyze it with respect to the absolute competitive ratio and prove tight bounds of 2 for any k...
متن کامل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 parameter k, and the goal is to partition the items into a minimum number of subsets such that for each subset S in the solution, the total size of the items in S is at most 1 (as in the classical bin packing problem) and the...
متن کاملFully Dynamic Bin Packing Revisited
We consider the fully dynamic bin packing problem, where items arrive and depart in an online fashion. The goal is to minimize the number of used bins at every timestep while repacking of already packed items is allowed. Ivković and Lloyd [IL98] have developed an algorithm with asymptotic competitive ratio of 5/4 using O(log n) (amortized) shifting moves whenever an item is inserted or removed ...
متن کاملOn-line bin-packing problem: maximizing the number of unused bins
In this paper, we study the on-line version of the bin-packing problem. We analyze the approximation behavior of an on-line bin-packing algorithm under an approximation criterion called differential ratio. We are interested in two types of results: the differential competitivity ratio guaranteed by the on-line algorithm and hardness results that account for the difficulty of the problem and for...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2013
ISSN: 0022-0000
DOI: 10.1016/j.jcss.2012.04.004