Improved online algorithms for the sorting buffer problem on line metrics
From MaRDI portal
Publication:2930290
DOI10.1145/1644015.1644030zbMath1300.68069OpenAlexW2052224952MaRDI QIDQ2930290
No author found.
Publication date: 18 November 2014
Published in: (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1644015.1644030
No records found.
No records found.
Related Items (5)
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 ⋮ NP-hardness of the sorting buffer problem on the uniform metric ⋮ Almost Tight Bounds for Reordering Buffer Management
This page was built for publication: Improved online algorithms for the sorting buffer problem on line metrics
