scientific article; zbMATH DE number 871933
From MaRDI portal
Publication:4875207
Recommendations
Cited in
(52)- The average-case analysis of some on-line algorithms for bin packing
- Does randomization help in on-line bin packing?
- On the competitiveness of the move-to-front rule
- Online-bounded analysis
- Evaluating the quality of online optimization algorithms by discrete event simulation
- List factoring and relative worst order analysis
- Scheduling In the random-order model
- Best fit bin packing with random order revisited
- Improved online algorithms for knapsack and GAP in the random order model
- Exact distributional analysis of online algorithms with lookahead
- Comparing the costs of any fit algorithms for bin packing
- Stochastic dominance and the bijective ratio of online algorithms
- Parameterized analysis of paging and list update algorithms
- Separating online scheduling algorithms with the relative worst order ratio
- Approximation and online algorithms for multidimensional bin packing: a survey
- Comparing online algorithms for bin packing problems
- A new variable-sized bin packing problem
- A comparison of performance measures via online search
- Bin packing using semi-ordinal data
- New results for the \(k\)-secretary problem
- Online Bin Covering: Expectations vs. Guarantees
- Optimal online edge coloring of planar graphs with advice
- Online bin covering: expectations vs. guarantees
- scientific article; zbMATH DE number 3888927 (Why is no real title available?)
- Biased Random Walks, Lyapunov Functions, and Stochastic Analysis of Best Fit Bin Packing
- Linear waste of best fit bin packing on skewed distributions
- Asymptotically optimal scheduling of random malleable demands in smart grid
- scientific article; zbMATH DE number 4773 (Why is no real title available?)
- Next-fit bin packing with random piece sizes
- Best fit bin packing with random order revisited
- scientific article; zbMATH DE number 7559382 (Why is no real title available?)
- Optimal analysis of best fit bin packing
- On the Relative Dominance of Paging Algorithms
- Closing the Gap Between Theory and Practice: New Measures for On-Line Algorithm Analysis
- Online bounded analysis
- Outperforming LRU via competitive analysis on parametrized inputs for paging
- Improved Online Algorithms for Knapsack and GAP in the Random Order Model
- Bounded space on-line bin packing: Best is better than first
- Machine covering in the random-order model
- Relative Worst-Order Analysis: A Survey
- Knapsack secretary through boosting
- Online minimum spanning trees with weight predictions
- On the separation and equivalence of paging strategies and other online algorithms
- Scheduling in the random-order model
- Best k-fit bin packing
- Near-optimal algorithms for stochastic online bin packing
- Lower bounds for several standard bin packing algorithms in the random order model
- List's worst-average-case or WAC ratio
- On the relative dominance of paging algorithms
- The relative worst-order ratio applied to paging
- Random-order bin packing
- Comparing first-fit and next-fit for online edge coloring
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)
