scientific article; zbMATH DE number 871933
From MaRDI portal
Publication:4875207
zbMath0847.68050MaRDI QIDQ4875207
Publication date: 18 June 1996
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (39)
Online-bounded analysis ⋮ List's worst-average-case or WAC ratio ⋮ On the relative dominance of paging algorithms ⋮ Online bin covering: expectations vs. guarantees ⋮ Evaluating the quality of online optimization algorithms by discrete event simulation ⋮ Separating online scheduling algorithms with the relative worst order ratio ⋮ Approximation and online algorithms for multidimensional bin packing: a survey ⋮ New results for the \(k\)-secretary problem ⋮ The relative worst-order ratio applied to paging ⋮ Optimal Online Edge Coloring of Planar Graphs with Advice ⋮ Machine covering in the random-order model ⋮ Relative Worst-Order Analysis: A Survey ⋮ Knapsack secretary through boosting ⋮ Online minimum spanning trees with weight predictions ⋮ Comparing online algorithms for bin packing problems ⋮ A new variable-sized bin packing problem ⋮ List factoring and relative worst order analysis ⋮ A comparison of performance measures via online search ⋮ On the Relative Dominance of Paging Algorithms ⋮ Asymptotically optimal scheduling of random malleable demands in smart grid ⋮ Improved Online Algorithms for Knapsack and GAP in the Random Order Model ⋮ On the separation and equivalence of paging strategies and other online algorithms ⋮ A comparison of performance measures for online algorithms ⋮ Scheduling In the random-order model ⋮ Best fit bin packing with random order revisited ⋮ Random-order bin packing ⋮ Comparing first-fit and next-fit for online edge coloring ⋮ Online Bounded Analysis ⋮ Unnamed Item ⋮ Improved online algorithms for Knapsack and GAP in the random order model ⋮ Closing the Gap Between Theory and Practice: New Measures for On-Line Algorithm Analysis ⋮ Exact distributional analysis of online algorithms with lookahead ⋮ Best Fit Bin Packing with Random Order Revisited ⋮ Stochastic dominance and the bijective ratio of online algorithms ⋮ On the competitiveness of the move-to-front rule ⋮ Unnamed Item ⋮ Comparing the costs of any fit algorithms for bin packing ⋮ Online Bin Covering: Expectations vs. Guarantees ⋮ Parameterized analysis of paging and list update algorithms
This page was built for publication:
