scientific article; zbMATH DE number 1305512
From MaRDI portal
Publication:4252403
Recommendations
- Dynamic storage allocation with limited compaction - complexity and some practical implications
- Approximation algorithms for dynamic storage allocation
- Insertion and Compaction Algorithms in Sequentially Allocated Storage
- A polynomial-time algorithm for memory space reduction
- scientific article; zbMATH DE number 4046862
Cited in
(26)- Resource allocation in bounded degree trees
- Fixed-sized blocks optimization
- Dynamic spectrum allocation: the impotency of duration notification.
- An approximation result for the interval coloring problem on claw-free chordal graphs
- On spectrum assignment in elastic optical tree-networks
- Approximation algorithms for routing and call scheduling in all-optical chains and rings.
- On the interval chromatic number of proper interval graphs
- Optimizing bandwidth allocation in elastic optical networks with application to scheduling
- A polynomial-time algorithm for memory space reduction
- An Aid For The Selection Of Efficient Storage Structures
- A (2+)-approximation algorithm for the storage allocation problem
- Efficient computation of optimal space-time performance curves for memory hierarchies
- scientific article; zbMATH DE number 1161584 (Why is no real title available?)
- scientific article; zbMATH DE number 2017363 (Why is no real title available?)
- scientific article; zbMATH DE number 1753953 (Why is no real title available?)
- An improved upper bound for the ring loading problem
- A constant factor approximation algorithm for the storage allocation problem
- Space overhead bounds for dynamic memory management with partial compaction
- scientific article; zbMATH DE number 5049786 (Why is no real title available?)
- Dynamic storage allocation with known durations
- Breaking the barrier of 2 for the storage allocation problem
- Approximation algorithms for round-UFP and round-SAP
- Single and multiple device DSA problems, complexities and online algorithms
- Using fractional primal-dual to schedule split intervals with demands
- Choosing an optimum version of main-memory allocation
- About equivalent interval colorings of weighted graphs
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 Q4252403)
