Improved Results for a Memory Allocation Problem

Leah Epstein; Rob van Stee

doi:10.1007/s00224-009-9226-2

Improved Results for a Memory Allocation Problem

Leah Epstein, Rob van Stee

Department of Mathematics

Research output: Contribution to journal › Article › peer-review

Abstract

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. (Theory Comput. Syst. 39(6):829-849, 2006). 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.

Original language	English
Pages (from-to)	79-92
Number of pages	14
Journal	Theory of Computing Systems
Volume	48
Issue number	1
DOIs	https://doi.org/10.1007/s00224-009-9226-2
State	Published - Jan 2011

Bibliographical note

Funding Information:
Work performed while R. van Stee was at University of Karlsruhe, Germany. Research supported by Alexander von Humboldt Foundation.

Keywords

Approximation algorithms
Bin packing
Cardinality constraints
Splittable items

ASJC Scopus subject areas

Theoretical Computer Science
Computational Theory and Mathematics

Access to Document

10.1007/s00224-009-9226-2

Cite this

@article{62a88f2220c14ec2b10bb9345da82e81,

title = "Improved Results for a Memory Allocation Problem",

abstract = "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. (Theory Comput. Syst. 39(6):829-849, 2006). 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.",

keywords = "Approximation algorithms, Bin packing, Cardinality constraints, Splittable items",

author = "Leah Epstein and {van Stee}, Rob",

note = "Funding Information: Work performed while R. van Stee was at University of Karlsruhe, Germany. Research supported by Alexander von Humboldt Foundation.",

year = "2011",

month = jan,

doi = "10.1007/s00224-009-9226-2",

language = "English",

volume = "48",

pages = "79--92",

journal = "Theory of Computing Systems",

issn = "1432-4350",

publisher = "Springer New York",

number = "1",

}

TY - JOUR

T1 - Improved Results for a Memory Allocation Problem

AU - Epstein, Leah

AU - van Stee, Rob

N1 - Funding Information: Work performed while R. van Stee was at University of Karlsruhe, Germany. Research supported by Alexander von Humboldt Foundation.

PY - 2011/1

Y1 - 2011/1

N2 - 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. (Theory Comput. Syst. 39(6):829-849, 2006). 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.

AB - 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. (Theory Comput. Syst. 39(6):829-849, 2006). 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.

KW - Approximation algorithms

KW - Bin packing

KW - Cardinality constraints

KW - Splittable items

UR - http://www.scopus.com/inward/record.url?scp=78650996879&partnerID=8YFLogxK

U2 - 10.1007/s00224-009-9226-2

DO - 10.1007/s00224-009-9226-2

M3 - Article

AN - SCOPUS:78650996879

SN - 1432-4350

VL - 48

SP - 79

EP - 92

JO - Theory of Computing Systems

JF - Theory of Computing Systems

IS - 1

ER -

Improved Results for a Memory Allocation Problem

Abstract

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this