Approximation algorithms for dynamic storage allocation
From MaRDI portal
Publication:4595477
DOI10.1007/3-540-61680-2_46zbMath1379.68351MaRDI QIDQ4595477
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
Related Items
An Improved Upper Bound for the Ring Loading Problem, Dynamic storage allocation with known durations, An approximation result for a periodic allocation problem, Single and multiple device DSA problems, complexities and online algorithms, 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, Fast primal-dual distributed algorithms for scheduling and matching problems, Optimizing bandwidth allocation in elastic optical networks with application to scheduling, A $$(2+\epsilon )$$-Approximation Algorithm for the Storage Allocation Problem