Approximation algorithms for dynamic storage allocation

DOI10.1007/3-540-61680-2_46zbMath1379.68351OpenAlexW1988392344MaRDI QIDQ4595477

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

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Approximation algorithms (68W25) Theory of operating systems (68N25)

Related Items (10)

A $$(2+\epsilon )$$-Approximation Algorithm for the Storage Allocation Problem ⋮ Fast primal-dual distributed algorithms for scheduling and matching problems ⋮ An Improved Upper Bound for the Ring Loading Problem ⋮ Optimizing bandwidth allocation in elastic optical networks with application to scheduling ⋮ On spectrum assignment in elastic optical tree-networks ⋮ Dynamic storage allocation with known durations ⋮ An approximation result for a periodic allocation problem ⋮ Single and multiple device DSA problems, complexities and online algorithms ⋮ Approximation algorithms for routing and call scheduling in all-optical chains and rings. ⋮ On the interval chromatic number of proper interval graphs

This page was built for publication: Approximation algorithms for dynamic storage allocation