Pages that link to "Item:Q4962197"
From MaRDI portal
The following pages link to An Improved Competitive Algorithm for Reordering Buffer Management (Q4962197):
Displaying 7 items.
- Tight bounds for online coloring of basic graph classes (Q2223701) (← links)
- Stochastic dominance and the bijective ratio of online algorithms (Q2309465) (← links)
- Generalized Reordering Buffer Management (Q2965475) (← 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)