New Approximations for Reordering Buffer Management
From MaRDI portal
Publication:5384043
DOI10.1137/1.9781611973402.81zbMath1422.68299OpenAlexW4232498808MaRDI QIDQ5384043
Publication date: 20 June 2019
Published in: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.722.4373
Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25) Randomized algorithms (68W20)
Related Items (3)
On the Randomized Competitive Ratio of Reordering Buffer Management with Non-Uniform Costs ⋮ Weighted Reordering Buffer Improved via Variants of Knapsack Covering Inequalities ⋮ Almost Tight Bounds for Reordering Buffer Management
This page was built for publication: New Approximations for Reordering Buffer Management
