The following pages link to (Q5417601):
Displaying 12 items.
- A note on sorting buffers offline (Q417998) (← links)
- NP-hardness of the sorting buffer problem on the uniform metric (Q427885) (← links)
- Logarithmic price of buffer downscaling on line metrics (Q1685970) (← links)
- Reordering buffer management with advice (Q1707821) (← links)
- Generalized Reordering Buffer Management (Q2965475) (← links)
- On the Randomized Competitive Ratio of Reordering Buffer Management with Non-Uniform Costs (Q3448775) (← links)
- Weighted Reordering Buffer Improved via Variants of Knapsack Covering Inequalities (Q3448831) (← links)
- Tight Bounds for Online Coloring of Basic Graph Classes (Q5111690) (← links)
- New Approximations for Reordering Buffer Management (Q5384043) (← links)
- Almost tight bounds for reordering buffer management (Q5419131) (← links)
- A Constant Factor Approximation Algorithm for Reordering Buffer Management (Q5741778) (← links)
- Almost Tight Bounds for Reordering Buffer Management (Q5864670) (← links)