An improved lower bound for on-line bin packing algorithms
Information Processing Letters
Analysis of Several Task-Scheduling Algorithms for a Model of Multiprogramming Computer Systems
Journal of the ACM (JACM)
New Algorithms for Bin Packing
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Algorithms for on-line bin-packing problems with cardinality constraints
Discrete Applied Mathematics
Parallelism versus Memory Allocation in Pipelined Router Forwarding Engines
Theory of Computing Systems
Online Bin Packing with Cardinality Constraints
SIAM Journal on Discrete Mathematics
Fast algorithms for bin packing
Journal of Computer and System Sciences
Approximation schemes for packing with item fragmentation
WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
Approximation schemes for packing splittable items with cardinality constraints
WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
| Hi-index | 0.00 |
We consider a memory allocation problem that 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 it 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 also strongly NP-hard. Additionally, we give an efficient 7/5-approximation algorithm.