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