New approximation algorithms for some dynamic storage allocation problems
From MaRDI portal
Recommendations
- Approximation algorithms for dynamic storage allocation
- scientific article; zbMATH DE number 4043214
- Single and multiple device DSA problem, complexities and online algorithms
- Single and multiple device DSA problems, complexities and online algorithms
- A polynomial time approximation algorithm for dynamic storage allocation
Cited in
(12)- A polynomial time approximation algorithm for dynamic storage allocation
- Three approximation algorithms for solving the generalized segregated storage problem.
- Scheduling under the network of temporo-spatial proximity relationships
- On spectrum assignment in elastic optical tree-networks
- Approximation bounds for the minimum k-storage problem
- Single and multiple device DSA problem, complexities and online algorithms
- scientific article; zbMATH DE number 1003306 (Why is no real title available?)
- scientific article; zbMATH DE number 4043214 (Why is no real title available?)
- Approximation algorithms for dynamic storage allocation
- Handling precedence constraints in scheduling problems by the sequence pair representation
- scientific article; zbMATH DE number 3273532 (Why is no real title available?)
- Single and multiple device DSA problems, complexities and online algorithms
This page was built for publication: New approximation algorithms for some dynamic storage allocation problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4681194)