Approximation algorithms for dynamic storage allocation
From MaRDI portal
Publication:4595477
Recommendations
Cited in
(34)- On the interval chromatic number of proper interval graphs
- Analysis of space allocation in a generally fragmented linear store
- Dynamic storage allocation with known durations
- Sharing in construction projects -- on determining optimal container assignments for the on-site accommodation of trades
- scientific article; zbMATH DE number 1003306 (Why is no real title available?)
- A polynomial time approximation algorithm for dynamic storage allocation
- Single and multiple device DSA problem, complexities and online algorithms
- Improved Results for a Memory Allocation Problem
- On approximating the memory-constrained module allocation problem
- Single and multiple device DSA problems, complexities and online algorithms
- Amortized analysis of some disk scheduling algorithms: SSTF, SCAN, and \(N\)-step SCAN
- scientific article; zbMATH DE number 2080220 (Why is no real title available?)
- OPTVersusLOADin Dynamic Storage Allocation
- On spectrum assignment in elastic optical tree-networks
- Optimal allocation of storage space
- A \((2+\varepsilon)\)-approximation algorithm for the storage allocation problem
- An approximation result for a periodic allocation problem
- Approximation algorithms for routing and call scheduling in all-optical chains and rings.
- Robust storage assignment in stack- and queue-based storage systems
- Dynamic storage allocation with limited compaction - complexity and some practical implications
- Optimizing bandwidth allocation in elastic optical networks with application to scheduling
- An improved upper bound for the ring loading problem
- Computing and Combinatorics
- Insertion and Compaction Algorithms in Sequentially Allocated Storage
- Improved results for a memory allocation problem
- Approximation bounds for the minimum \(k\)-storage problem
- OPT versus LOAD in dynamic storage allocation
- scientific article; zbMATH DE number 6399332 (Why is no real title available?)
- scientific article; zbMATH DE number 4043214 (Why is no real title available?)
- scientific article; zbMATH DE number 3273532 (Why is no real title available?)
- Finite-size scaling approach to dynamic storage allocation problem
- Fast primal-dual distributed algorithms for scheduling and matching problems
- scientific article; zbMATH DE number 1926660 (Why is no real title available?)
- Three approximation algorithms for solving the generalized segregated storage problem.
This page was built for publication: Approximation algorithms for dynamic storage allocation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4595477)
