scientific article; zbMATH DE number 4043214

MaRDI QIDQ3780409zbMATH OpenFDO

Authors Maciej Ślusarek

Publication date 1987

zbMATH Keywords

strong NP-completenessdynamic storage allocation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Theory of software (68N99)

Recommendations

• Computing and Combinatorics
• Approximation algorithms for dynamic storage allocation
• Dynamic storage allocation with limited compaction - complexity and some practical implications
• Insertion and Compaction Algorithms in Sequentially Allocated Storage
• A polynomial time approximation algorithm for dynamic storage allocation

Cited in

(10)

• A note on the dynamic storage allocation problem
• Single and multiple device DSA problem, complexities and online algorithms
• Single and multiple device DSA problems, complexities and online algorithms
• Robust spectrum allocation in elastic flexgrid optical networks: complexity and formulations
• On some packing problem related to dynamic storage allocation
• On the complexity of interval scheduling with a resource constraint
• Dynamic storage allocation with limited compaction - complexity and some practical implications
• Computing and Combinatorics
• Insertion and Compaction Algorithms in Sequentially Allocated Storage
• Optimal interval scheduling with a resource constraint

This page was built for publication:

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