Pages that link to "Item:Q5741778"
From MaRDI portal
The following pages link to A Constant Factor Approximation Algorithm for Reordering Buffer Management (Q5741778):
Displaying 14 items.
- A cost-based buffer replacement algorithm for object-oriented database systems (Q1602537) (← links)
- Reordering buffer management with advice (Q1707821) (← links)
- Tight bounds for online coloring of basic graph classes (Q2223701) (← links)
- The time buffer approximated buffer allocation problem: a row-column generation approach (Q2289911) (← links)
- Stochastic dominance and the bijective ratio of online algorithms (Q2309465) (← 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)
- (Q4696372) (← links)
- New Approximations for Reordering Buffer Management (Q5384043) (← links)
- Buffered Resource Constraint: Algorithms and Complexity (Q5418740) (← links)
- Almost tight bounds for reordering buffer management (Q5419131) (← links)
- Almost Tight Bounds for Reordering Buffer Management (Q5864670) (← links)
- LATIN 2004: Theoretical Informatics (Q5901639) (← links)