An improved competitive algorithm for reordering buffer management

DOI10.1145/2663347MaRDI QIDQ4962197zbMATH OpenOpenAlexFDO

Authors Noa Avigdor-Elgrabli, Yuval Rabani

Publication date 30 October 2018

Published in ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2663347

zbMATH Keywords

online computingreordering buffer management

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Analysis of algorithms (68W40)

Recommendations

• An improved competitive algorithm for reordering buffer management
• Almost tight bounds for reordering buffer management
• On the randomized competitive ratio of reordering buffer management with non-uniform costs
• Automata, Languages and Programming
• New Approximations for Reordering Buffer Management

Cited in

(14)

• Tight bounds for online coloring of basic graph classes
• Stochastic dominance and the bijective ratio of online algorithms
• Generalized Reordering Buffer Management
• On the randomized competitive ratio of reordering buffer management with non-uniform costs
• Weighted reordering buffer improved via variants of knapsack covering inequalities
• Reordering buffers with logarithmic diameter dependency for trees
• Evaluation of Online Strategies for Reordering Buffers
• New Approximations for Reordering Buffer Management
• Evaluation of online strategies for reordering buffers
• An improved competitive algorithm for reordering buffer management
• Almost tight bounds for reordering buffer management
• Automata, Languages and Programming
• A Constant Factor Approximation Algorithm for Reordering Buffer Management
• Almost Tight Bounds for Reordering Buffer Management

This page was built for publication: An improved competitive algorithm for reordering buffer management

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4962197)