A new measure for the study of on-line algorithms
From MaRDI portal
Publication:1312188
DOI10.1007/BF01294264zbMath0782.68052OpenAlexW2075354456MaRDI QIDQ1312188
Publication date: 26 January 1994
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01294264
Related Items (42)
Online-bounded analysis ⋮ On the relative dominance of paging algorithms ⋮ Quantifying Competitiveness in Paging with Locality of Reference ⋮ Online bin covering: expectations vs. guarantees ⋮ Evaluating the quality of online optimization algorithms by discrete event simulation ⋮ On the online min-wait relocation problem ⋮ Separating online scheduling algorithms with the relative worst order ratio ⋮ Measuring the problem-relevant information in input ⋮ Approximating the Canadian traveller problem with online randomization ⋮ The relative worst-order ratio applied to paging ⋮ A competitive analysis of the list update problem with lookahead ⋮ Optimal Online Edge Coloring of Planar Graphs with Advice ⋮ A Competitive analysis of the list update problem with lookahead ⋮ Price discrimination with robust beliefs ⋮ Relative Worst-Order Analysis: A Survey ⋮ 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 ⋮ On the separation and equivalence of paging strategies and other online algorithms ⋮ A comparison of performance measures for online algorithms ⋮ Online Vehicle Routing Problems: A Survey ⋮ A note on the \(k\)-Canadian traveller problem ⋮ Comparing first-fit and next-fit for online edge coloring ⋮ Online Bounded Analysis ⋮ Unnamed Item ⋮ Closing the Gap Between Theory and Practice: New Measures for On-Line Algorithm Analysis ⋮ Quantifying competitiveness in paging with locality of reference ⋮ List Update with Locality of Reference ⋮ Exact distributional analysis of online algorithms with lookahead ⋮ Stochastic dominance and the bijective ratio of online algorithms ⋮ On competitive on-line paging with lookahead ⋮ A Survey of Algorithms and Models for List Update ⋮ A Risk-Reward Competitive Analysis for the Recoverable Canadian Traveller Problem ⋮ Delayed information and action in on-line algorithms ⋮ Unnamed Item ⋮ Generalized Canadian traveller problems ⋮ Online Bin Covering: Expectations vs. Guarantees ⋮ Parameterized analysis of paging and list update algorithms ⋮ Relatively robust decisions ⋮ An optimal randomized online algorithm for the \(k\)-Canadian traveller problem on node-disjoint paths
Cites Work
This page was built for publication: A new measure for the study of on-line algorithms
