A Constant Factor Approximation Algorithm for Reordering Buffer Management
From MaRDI portal
Publication:5741778
DOI10.1137/1.9781611973105.70zbMath1422.68285arXiv1202.4504OpenAlexW2949281429MaRDI QIDQ5741778
Yuval Rabani, Noa Avigdor-Elgrabli
Publication date: 15 May 2019
Published in: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1202.4504
Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)
Related Items (6)
On the Randomized Competitive Ratio of Reordering Buffer Management with Non-Uniform Costs ⋮ Weighted Reordering Buffer Improved via Variants of Knapsack Covering Inequalities ⋮ Reordering buffer management with advice ⋮ Tight bounds for online coloring of basic graph classes ⋮ Stochastic dominance and the bijective ratio of online algorithms ⋮ Almost Tight Bounds for Reordering Buffer Management
This page was built for publication: A Constant Factor Approximation Algorithm for Reordering Buffer Management
