Improved Results for a Memory Allocation Problem

DOI10.1007/978-3-540-73951-7_32MaRDI QIDQ3603541zbMATH OpenOpenAlexFDO

Authors Leah Epstein, Rob van Stee

Publication date 17 February 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-73951-7_32

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Recommendations

• Improved results for a memory allocation problem
• On Packing Splittable Items with Cardinality Constraints
• Approximation algorithms for dynamic storage allocation
• Bin packing with fragmentable items: presentation and approximations
• Algorithms for on-line bin-packing problems with cardinality constraints

Cited in

(4)

• Approximation schemes for packing splittable items with cardinality constraints
• Improved results for a memory allocation problem
• Approximation Schemes for Packing Splittable Items with Cardinality Constraints
• Fast allocation and deallocation with an improved buddy system

This page was built for publication: Improved Results for a Memory Allocation Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3603541)