OPTVersusLOADin Dynamic Storage Allocation
From MaRDI portal
Publication:4651485
DOI10.1137/S0097539703423941zbMath1101.68599MaRDI QIDQ4651485
Mikkel Thorup, Nick Reingold, Claire M. Kenyon, Howard J. Karloff, Adam L. Buchsbaum
Publication date: 21 February 2005
Published in: SIAM Journal on Computing (Search for Journal in Brave)
68Q25: Analysis of algorithms and problem complexity
68W40: Analysis of algorithms
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
68W25: Approximation algorithms
Related Items
Optimizing active ranges for consistent dynamic map labeling, A constant factor approximation algorithm for the storage allocation problem, First-fit coloring of bounded tolerance graphs, Strip packing with precedence constraints and strip packing with release times, Scheduling with conflicts: Online and offline algorithms, About equivalent interval colorings of weighted graphs, Resource allocation in bounded degree trees, On the interval chromatic number of proper interval graphs, Optimizing bandwidth allocation in elastic optical networks with application to scheduling, Profit Maximization in Flex-Grid All-Optical Networks, On minimizing dataset transfer time in an acyclic network with four servers, A $$(2+\epsilon )$$-Approximation Algorithm for the Storage Allocation Problem
