scientific article; zbMATH DE number 1947443
From MaRDI portal
Publication:4411413
zbMath1019.68509MaRDI QIDQ4411413
Harald Räcke, Christian Sohler, Matthias Westermann
Publication date: 8 July 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2461/24610820.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (11)
On the Randomized Competitive Ratio of Reordering Buffer Management with Non-Uniform Costs ⋮ Weighted Reordering Buffer Improved via Variants of Knapsack Covering Inequalities ⋮ Logarithmic price of buffer downscaling on line metrics ⋮ Dynamic scheduling of a picking robot with limited buffer and rejection: an industrial case study ⋮ A note on sorting buffers offline ⋮ NP-hardness of the sorting buffer problem on the uniform metric ⋮ Reordering buffer management with advice ⋮ Buffer management for colored packets with deadlines ⋮ Online and offline algorithms for the sorting buffers problem on the line metric ⋮ Stochastic dominance and the bijective ratio of online algorithms ⋮ Almost Tight Bounds for Reordering Buffer Management
This page was built for publication:
