scientific article; zbMATH DE number 7204485

DOI10.4230/LIPICS.ICALP.2017.33MaRDI QIDQ5111364zbMATH OpenFDO

Authors Matthias Kohler, Harald Räcke

Publication date 27 May 2020

zbMATH Keywords

online algorithmsmetric spacesschedulingreordering buffer

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Deterministic scheduling theory in operations research (90B35)

Recommendations

• scientific article; zbMATH DE number 5899288
• Reordering buffers with logarithmic diameter dependency for trees
• Almost tight bounds for reordering buffer management
• A bicriteria approximation for the reordering buffer problem
• Generalized Reordering Buffer Management

Cited in

(9)

• New Approximations for Reordering Buffer Management
• Almost Tight Bounds for Reordering Buffer Management
• scientific article; zbMATH DE number 5899288 (Why is no real title available?)
• Almost tight bounds for reordering buffer management
• Generalized Reordering Buffer Management
• A bicriteria approximation for the reordering buffer problem
• Logarithmic price of buffer downscaling on line metrics
• Reordering buffers with logarithmic diameter dependency for trees
• A Constant Factor Approximation Algorithm for Reordering Buffer Management

This page was built for publication:

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