LATIN 2004: Theoretical Informatics

DOI10.1007/b95852zbMath1196.90049OpenAlexW2475444492MaRDI QIDQ5901639

Jens S. Kohrt, Kirk R. Pruhs

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

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)

Related Items (7)

Weighted Reordering Buffer Improved via Variants of Knapsack Covering Inequalities ⋮ A note on sorting buffers offline ⋮ NP-hardness of the sorting buffer problem on the uniform metric ⋮ Exploiting locality: Approximating sorting buffers ⋮ Buffer management for colored packets with deadlines ⋮ Online and offline algorithms for the sorting buffers problem on the line metric ⋮ Almost Tight Bounds for Reordering Buffer Management

This page was built for publication: LATIN 2004: Theoretical Informatics