A comparison of performance measures via online search

DOI10.1016/j.tcs.2013.07.022zbMath1359.68323OpenAlexW2172585874MaRDI QIDQ2445866

Kim S. Larsen, Abyayananda Maiti, Joan. Boyar

Publication date: 15 April 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2013.07.022

zbMATH Keywords

performance measuresonline algorithmsonline search

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27)

Related Items (7)

Online bin covering: expectations vs. guarantees ⋮ Competitive difference analysis of the one-way trading problem with limited information ⋮ The Frequent Items Problem in Online Streaming Under Various Performance Measures ⋮ Best-of-both-worlds analysis of online search ⋮ Relative Worst-Order Analysis: A Survey ⋮ On the separation and equivalence of paging strategies and other online algorithms ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A comparison of performance measures for online algorithms
• On the relative dominance of paging algorithms
• The relative worst-order ratio applied to paging
• Random-order bin packing
• A new measure for the study of on-line algorithms
• A risk-reward framework for the competitive analysis of financial games
• The Accommodating Function: A Generalization of the Competitive Ratio
• Optimal Buy-and-Hold Strategies for Financial Markets with Bounded Daily Returns
• The relative worst order ratio for online algorithms
• Optimal search and one-way trading online algorithms

This page was built for publication: A comparison of performance measures via online search