Improved Online Algorithms for the Sorting Buffer Problem

DOI10.1007/978-3-540-70918-3_56MaRDI QIDQ3590972zbMATH OpenOpenAlexFDO

Authors Iftah Gamzu, Danny Segev

Publication date 3 September 2007

Published in STACS 2007 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-70918-3_56

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27)

Recommendations

• Improved online algorithms for the sorting buffer problem on line metrics
• Online and offline algorithms for the sorting buffers problem on the line metric
• Online Sorting Buffers on Line
• Offline Sorting Buffers on Line
• scientific article; zbMATH DE number 5899288

Cited in

(14)

• Online and offline algorithms for the sorting buffers problem on the line metric
• Improved online algorithms for jumbled matching
• Improved online algorithms for the sorting buffer problem on line metrics
• A note on sorting buffers offline
• NP-hardness of the sorting buffer problem on the uniform metric
• Improved Randomized On-Line Algorithms for the List Update Problem
• scientific article; zbMATH DE number 1947443 (Why is no real title available?)
• scientific article; zbMATH DE number 910898 (Why is no real title available?)
• Online Sorting Buffers on Line
• Offline Sorting Buffers on Line
• Approximation and Online Algorithms
• LATIN 2004: Theoretical Informatics
• Buffer management for colored packets with deadlines
• Exploiting locality: Approximating sorting buffers

This page was built for publication: Improved Online Algorithms for the Sorting Buffer Problem

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