Online and offline algorithms for the sorting buffers problem on the line metric
From MaRDI portal
Publication:2266935
DOI10.1016/j.jda.2008.08.002zbMath1191.68884OpenAlexW2120305839MaRDI QIDQ2266935
Vinayaka Pandit, Rohit Khandekar
Publication date: 26 February 2010
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2008.08.002
Searching and sorting (68P10) Approximation algorithms (68W25) Online algorithms; streaming algorithms (68W27)
Related Items
Logarithmic price of buffer downscaling on line metrics ⋮ A note on sorting buffers offline ⋮ NP-hardness of the sorting buffer problem on the uniform metric ⋮ Almost Tight Bounds for Reordering Buffer Management
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Exploiting locality: Approximating sorting buffers
- Algorithms for Capacitated Vehicle Routing
- Dial a Ride from k-Forest
- Improved Online Algorithms for the Sorting Buffer Problem
- Automata, Languages and Programming
- A tight bound on approximating arbitrary metrics by tree metrics
- LATIN 2004: Theoretical Informatics