Improved results for a memory allocation problem

Leah Epstein, Rob Van Stee

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publicationAlgorithms and Data Structures - 10th International Workshop, WADS 2007, Proceedings
PublisherSpringer Verlag
Pages362-373
Number of pages12
ISBN (Print)3540739483, 9783540739487
DOIs
StatePublished - 2007
Event10th International Workshop on Algorithms and Data Structures, WADS 2007 - Halifax, Canada
Duration: 15 Aug 200717 Aug 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4619 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference10th International Workshop on Algorithms and Data Structures, WADS 2007
Country/TerritoryCanada
CityHalifax
Period15/08/0717/08/07

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science (all)

Fingerprint

Dive into the research topics of 'Improved results for a memory allocation problem'. Together they form a unique fingerprint.

Cite this