LATIN 2004: Theoretical Informatics
From MaRDI portal
Publication:5901639
DOI10.1007/b95852zbMath1196.90049MaRDI QIDQ5901639
Publication date: 7 May 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b95852
Related Items
Almost Tight Bounds for Reordering Buffer Management, A note on sorting buffers offline, NP-hardness of the sorting buffer problem on the uniform metric, Buffer management for colored packets with deadlines, Exploiting locality: Approximating sorting buffers, Online and offline algorithms for the sorting buffers problem on the line metric, Weighted Reordering Buffer Improved via Variants of Knapsack Covering Inequalities