scientific article; zbMATH DE number 871933
From MaRDI portal
Publication:4875207
zbMATH Open0847.68050MaRDI QIDQ4875207FDOQ4875207
Publication date: 18 June 1996
Title of this publication is not available (Why is that?)
Cited In (41)
- Title not available (Why is that?)
- 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
- Optimal Online Edge Coloring of Planar Graphs with Advice
- 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
- Online-bounded analysis
- Online Bounded Analysis
- Scheduling In the random-order model
- Online bin covering: expectations vs. guarantees
- A comparison of performance measures for online algorithms
- Evaluating the quality of online optimization algorithms by discrete event simulation
- Bin packing using semi-ordinal data
- Improved online algorithms for Knapsack and GAP in the random order model
- 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 relative worst-order ratio applied to paging
- Random-order bin packing
- Exact distributional analysis of online algorithms with lookahead
- On the competitiveness of the move-to-front rule
- New results for the \(k\)-secretary problem
- 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
- Title not available (Why is that?)
- On the Relative Dominance of Paging Algorithms
- Best Fit Bin Packing with Random Order Revisited
- 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
- 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)
