Weighted Reordering Buffer Improved via Variants of Knapsack Covering Inequalities

DOI10.1007/978-3-662-47672-7_60zbMath1440.68031OpenAlexW2394766078MaRDI QIDQ3448831

Benjamin Moseley, Sungjin Im

Publication date: 27 October 2015

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-47672-7_60

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items (1)

Almost Tight Bounds for Reordering Buffer Management

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on sorting buffers offline
• NP-hardness of the sorting buffer problem on the uniform metric
• Exploiting locality: Approximating sorting buffers
• The k-Client Problem
• Improved online algorithms for the sorting buffer problem on line metrics
• On the Randomized Competitive Ratio of Reordering Buffer Management with Non-Uniform Costs
• Online Stochastic Reordering Buffer Scheduling
• New Approximations for Reordering Buffer Management
• Almost tight bounds for reordering buffer management
• Online Sorting Buffers on Line
• Automata, Languages and Programming
• A Constant Factor Approximation Algorithm for Reordering Buffer Management
• LATIN 2004: Theoretical Informatics

This page was built for publication: Weighted Reordering Buffer Improved via Variants of Knapsack Covering Inequalities