Online and offline algorithms for the sorting buffers problem on the line metric
From MaRDI portal
Publication:2266935
DOI10.1016/J.JDA.2008.08.002zbMATH Open1191.68884OpenAlexW2120305839MaRDI QIDQ2266935FDOQ2266935
Authors: Rohit Khandekar, Vinayaka Pandit 
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
Recommendations
Online algorithms; streaming algorithms (68W27) Searching and sorting (68P10) Approximation algorithms (68W25)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A tight bound on approximating arbitrary metrics by tree metrics
- Title not available (Why is that?)
- Automata, Languages and Programming
- LATIN 2004: Theoretical Informatics
- Exploiting locality: Approximating sorting buffers
- Dial a Ride from k-Forest
- Improved Online Algorithms for the Sorting Buffer Problem
- Algorithms for capacitated vehicle routing
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)
