The following pages link to (Q4875207):
Displaying 31 items.
- Online bin covering: expectations vs. guarantees (Q300236) (← links)
- A comparison of performance measures for online algorithms (Q494791) (← links)
- On the separation and equivalence of paging strategies and other online algorithms (Q666671) (← links)
- List's worst-average-case or WAC ratio (Q835596) (← links)
- On the relative dominance of paging algorithms (Q837160) (← links)
- The relative worst-order ratio applied to paging (Q881599) (← links)
- Random-order bin packing (Q948706) (← links)
- Comparing first-fit and next-fit for online edge coloring (Q964390) (← links)
- On the competitiveness of the move-to-front rule (Q1575556) (← links)
- Online-bounded analysis (Q1617274) (← links)
- Evaluating the quality of online optimization algorithms by discrete event simulation (Q1642796) (← links)
- List factoring and relative worst order analysis (Q1950393) (← links)
- Scheduling In the random-order model (Q1979454) (← links)
- Best fit bin packing with random order revisited (Q1979457) (← links)
- Improved online algorithms for Knapsack and GAP in the random order model (Q2032350) (← links)
- Exact distributional analysis of online algorithms with lookahead (Q2044551) (← links)
- Comparing the costs of any fit algorithms for bin packing (Q2102827) (← links)
- Stochastic dominance and the bijective ratio of online algorithms (Q2309465) (← links)
- Parameterized analysis of paging and list update algorithms (Q2346961) (← links)
- Separating online scheduling algorithms with the relative worst order ratio (Q2385472) (← links)
- Approximation and online algorithms for multidimensional bin packing: a survey (Q2400930) (← links)
- Comparing online algorithms for bin packing problems (Q2434261) (← links)
- A new variable-sized bin packing problem (Q2434283) (← links)
- A comparison of performance measures via online search (Q2445866) (← links)
- New results for the \(k\)-secretary problem (Q2658048) (← links)
- Online Bin Covering: Expectations vs. Guarantees (Q2867122) (← links)
- Optimal Online Edge Coloring of Planar Graphs with Advice (Q2947032) (← links)
- Best Fit Bin Packing with Random Order Revisited (Q5089165) (← links)
- (Q5089171) (← links)
- Improved Online Algorithms for Knapsack and GAP in the Random Order Model (Q5875474) (← links)
- Machine covering in the random-order model (Q6103518) (← links)
