Approximation algorithms for dynamic storage allocation
From MaRDI portal
Publication:4595477
DOI10.1007/3-540-61680-2_46zbMATH Open1379.68351OpenAlexW1988392344MaRDI QIDQ4595477FDOQ4595477
Authors: Jordan Gergov
Publication date: 5 December 2017
Published in: Algorithms — ESA '96 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-61680-2_46
Recommendations
Cited In (34)
- Sharing in construction projects -- on determining optimal container assignments for the on-site accommodation of trades
- Approximation algorithms for routing and call scheduling in all-optical chains and rings.
- Improved results for a memory allocation problem
- Title not available (Why is that?)
- Finite-size scaling approach to dynamic storage allocation problem
- A polynomial time approximation algorithm for dynamic storage allocation
- OPT versus LOAD in dynamic storage allocation
- On spectrum assignment in elastic optical tree-networks
- On approximating the memory-constrained module allocation problem
- Amortized analysis of some disk scheduling algorithms: SSTF, SCAN, and \(N\)-step SCAN
- Robust storage assignment in stack- and queue-based storage systems
- Approximation bounds for the minimum \(k\)-storage problem
- Insertion and Compaction Algorithms in Sequentially Allocated Storage
- Title not available (Why is that?)
- An Improved Upper Bound for the Ring Loading Problem
- Title not available (Why is that?)
- Dynamic storage allocation with limited compaction - complexity and some practical implications
- Dynamic storage allocation with known durations
- A $$(2+\epsilon )$$-Approximation Algorithm for the Storage Allocation Problem
- Single and multiple device DSA problems, complexities and online algorithms
- Three approximation algorithms for solving the generalized segregated storage problem.
- An approximation result for a periodic allocation problem
- Optimizing bandwidth allocation in elastic optical networks with application to scheduling
- Optimal allocation of storage space
- Computing and Combinatorics
- Fast primal-dual distributed algorithms for scheduling and matching problems
- Single and multiple device DSA problem, complexities and online algorithms
- Title not available (Why is that?)
- Title not available (Why is that?)
- OPTVersusLOADin Dynamic Storage Allocation
- Improved Results for a Memory Allocation Problem
- On the interval chromatic number of proper interval graphs
- Title not available (Why is that?)
- Analysis of space allocation in a generally fragmented linear store
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)