An off-line storage allocation algorithm

DOI10.1016/0020-0190(87)90096-2zbMath0653.68005OpenAlexW2166952631MaRDI QIDQ1107966

Maciej Ślusarek

Publication date: 1987

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(87)90096-2

zbMATH Keywords

combinatorial problemresource allocationNP-hardapproximation strategyoff- line dynamic storage allocation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05) Theory of operating systems (68N25)

Related Items (2)

Preorders, Partial Semigroups, and Quantales ⋮ On some packing problem related to dynamic storage allocation

Cites Work

• A note on the dynamic storage allocation problem
• A dynamic storage allocation problem
• On some packing problem related to dynamic storage allocation
• Bounds for Some Functions Concerning Dynamic Storage Allocation
• Unnamed Item
• Unnamed Item

This page was built for publication: An off-line storage allocation algorithm