Reordering buffers with logarithmic diameter dependency for trees

DOI10.1137/1.9781611974782.79MaRDI QIDQ4575821zbMATH OpenOpenAlexFDO

Authors Matthias Englert, Harald Räcke

Publication date 16 July 2018

Published in Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1.9781611974782.79

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Online algorithms; streaming algorithms (68W27) Deterministic scheduling theory in operations research (90B35)

Recommendations

• scientific article; zbMATH DE number 5899288
• scientific article; zbMATH DE number 7204485
• Almost tight bounds for reordering buffer management
• A bicriteria approximation for the reordering buffer problem
• An improved competitive algorithm for reordering buffer management

Cited in

(5)

• Logarithmic price of buffer downscaling on line metrics
• scientific article; zbMATH DE number 5899288 (Why is no real title available?)
• scientific article; zbMATH DE number 7204485 (Why is no real title available?)
• Almost Tight Bounds for Reordering Buffer Management
• Adaptive-adversary-robust algorithms via small copy tree embeddings

This page was built for publication: Reordering buffers with logarithmic diameter dependency for trees

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