Online and offline algorithms for the sorting buffers problem on the line metric
From MaRDI portal
Publication:2266935
Recommendations
Cites work
- scientific article; zbMATH DE number 5485491 (Why is no real title available?)
- scientific article; zbMATH DE number 1947443 (Why is no real title available?)
- scientific article; zbMATH DE number 1775400 (Why is no real title available?)
- A tight bound on approximating arbitrary metrics by tree metrics
- Algorithms for capacitated vehicle routing
- Automata, Languages and Programming
- Dial a Ride from k-Forest
- Exploiting locality: Approximating sorting buffers
- Improved Online Algorithms for the Sorting Buffer Problem
- LATIN 2004: Theoretical Informatics
Cited in
(10)- Almost Tight Bounds for Reordering Buffer Management
- Online Sorting Buffers on Line
- Offline Sorting Buffers on Line
- A note on sorting buffers offline
- NP-hardness of the sorting buffer problem on the uniform metric
- LATIN 2004: Theoretical Informatics
- On-line sorting of twisted sequences in linear time
- Improved Online Algorithms for the Sorting Buffer Problem
- Logarithmic price of buffer downscaling on line metrics
- Improved online algorithms for the sorting buffer problem on line metrics
This page was built for publication: Online and offline algorithms for the sorting buffers problem on the line metric
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2266935)