@inproceedings{d6992552a04b4ba9bd5fb503dda4a48c,
title = "Improved results for a memory allocation problem",
abstract = "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.",
author = "Leah Epstein and {Van Stee}, Rob",
year = "2007",
doi = "10.1007/978-3-540-73951-7_32",
language = "English",
isbn = "3540739483",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "362--373",
booktitle = "Algorithms and Data Structures - 10th International Workshop, WADS 2007, Proceedings",
address = "Germany",
note = "10th International Workshop on Algorithms and Data Structures, WADS 2007 ; Conference date: 15-08-2007 Through 17-08-2007",
}