Pages that link to "Item:Q5419131"
From MaRDI portal
The following pages link to Almost tight bounds for reordering buffer management (Q5419131):
Displaying 7 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)
- Stochastic dominance and the bijective ratio of online algorithms (Q2309465) (← 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)
