scientific article; zbMATH DE number 7204485

DOI10.4230/LIPICS.ICALP.2017.33zbMATH Open1441.68296MaRDI QIDQ5111364FDOQ5111364

Authors: Matthias Kohler, Harald Räcke 

Publication date: 27 May 2020

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

online algorithmsmetric spacesschedulingreordering buffer

Mathematics Subject Classification ID

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

Cited In (6)

• Almost Tight Bounds for Reordering Buffer Management
• Almost tight bounds for reordering buffer management
• Title not available (Why is that?)
• Generalized Reordering Buffer Management
• A Constant Factor Approximation Algorithm for Reordering Buffer Management
• New Approximations 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)