Improved results for a memory allocation problem

We consider a memory allocation problem. This problem can be modeled as a version of bin packing where items may be split, but each bin may contain at most two (parts of) items. This problem was recently introduced by Chung et al. [3]. We give a simple 3 2 -approximation algorithm for this problem which is in fact an online algorithm. This algorithm also has good performance for the more general case where each bin may contain at most k parts of items. We show that this general case is strongly NP-hard for any k 3. Additionally, we design an efficient approximation algorithm, for which the approximation ratio can be made arbitrarily close to 7 5 .

• Type: Journal
• Year: 2006
• Where: CORR
• Authors: Leah Epstein, Rob van Stee
• Keywords: Algorithm, CORR 2006, Education, General Case, Memory Allocation Problem