Offline Sorting Buffers on Line

DOI10.1007/11940128_10MaRDI QIDQ5459104zbMATH OpenOpenAlexFDO

Authors Rohit Khandekar, Vinayaka Pandit

Publication date 24 April 2008

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11940128_10

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Dynamic programming (90C39) Approximation algorithms (68W25) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Online and offline algorithms for the sorting buffers problem on the line metric
• Online Sorting Buffers on Line
• Improved Online Algorithms for the Sorting Buffer Problem
• A note on sorting buffers offline
• Improved online algorithms for the sorting buffer problem on line metrics

Cited in

(9)

• Online Sorting Buffers on Line
• Online and offline algorithms for the sorting buffers problem on the line metric
• A note on sorting buffers offline
• NP-hardness of the sorting buffer problem on the uniform metric
• Buffer minimization with conflicts on a line
• Improved online algorithms for the sorting buffer problem on line metrics
• Buffer management for colored packets with deadlines
• A bicriteria approximation for the reordering buffer problem
• Improved Online Algorithms for the Sorting Buffer Problem

This page was built for publication: Offline Sorting Buffers on Line

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5459104)