Improved Online Algorithms for the Sorting Buffer Problem
From MaRDI portal
Publication:3590972
DOI10.1007/978-3-540-70918-3_56zbMATH Open1186.68569OpenAlexW1867520515MaRDI QIDQ3590972FDOQ3590972
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
Recommendations
Cited In (11)
- Title not available (Why is that?)
- Online Sorting Buffers on Line
- Offline Sorting Buffers on Line
- Improved Randomized On-Line Algorithms for the List Update Problem
- Buffer management for colored packets with deadlines
- Title not available (Why is that?)
- LATIN 2004: Theoretical Informatics
- Exploiting locality: Approximating sorting buffers
- Online and offline algorithms for the sorting buffers problem on the line metric
- Approximation and Online Algorithms
- Improved online algorithms for jumbled matching
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)