scientific article; zbMATH DE number 871933
From MaRDI portal
Publication:4875207
zbMATH Open0847.68050MaRDI QIDQ4875207FDOQ4875207
Authors: Claire Kenyon 
Publication date: 18 June 1996
Title of this publication is not available (Why is that?)
Recommendations
Cited In (48)
- Title not available (Why is that?)
- Outperforming LRU via competitive analysis on parametrized inputs for paging
- Best \(k\)-fit bin packing
- Comparing the costs of any fit algorithms for bin packing
- Improved Online Algorithms for Knapsack and GAP in the Random Order Model
- Comparing first-fit and next-fit for online edge coloring
- List's worst-average-case or WAC ratio
- Closing the Gap Between Theory and Practice: New Measures for On-Line Algorithm Analysis
- Next-fit bin packing with random piece sizes
- Best fit bin packing with random order revisited
- Best fit bin packing with random order revisited
- Online-bounded analysis
- Scheduling In the random-order model
- Online bin covering: expectations vs. guarantees
- A comparison of performance measures for online algorithms
- Improved online algorithms for knapsack and GAP in the random order model
- Evaluating the quality of online optimization algorithms by discrete event simulation
- Bin packing using semi-ordinal data
- Online minimum spanning trees with weight predictions
- Approximation and online algorithms for multidimensional bin packing: a survey
- Stochastic dominance and the bijective ratio of online algorithms
- The average-case analysis of some on-line algorithms for bin packing
- The relative worst-order ratio applied to paging
- Title not available (Why is that?)
- Random-order bin packing
- Exact distributional analysis of online algorithms with lookahead
- On the competitiveness of the move-to-front rule
- Online bounded analysis
- Bounded space on-line bin packing: Best is better than first
- New results for the \(k\)-secretary problem
- Linear waste of best fit bin packing on skewed distributions
- Relative Worst-Order Analysis: A Survey
- Parameterized analysis of paging and list update algorithms
- Asymptotically optimal scheduling of random malleable demands in smart grid
- Knapsack secretary through boosting
- List factoring and relative worst order analysis
- On the Relative Dominance of Paging Algorithms
- Machine covering in the random-order model
- Comparing online algorithms for bin packing problems
- A comparison of performance measures via online search
- On the relative dominance of paging algorithms
- Optimal analysis of best fit bin packing
- Optimal online edge coloring of planar graphs with advice
- Does randomization help in on-line bin packing?
- Online Bin Covering: Expectations vs. Guarantees
- Separating online scheduling algorithms with the relative worst order ratio
- On the separation and equivalence of paging strategies and other online algorithms
- A new variable-sized bin packing problem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4875207)
