Adding isolated vertices makes some greedy online algorithms optimal

Boyar, Joan; Kudahl, Christian

doi:10.1016/j.dam.2017.02.025

Cited by 2 publications

(1 citation statement)

References 19 publications

(25 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Other problems have also been considered, see Boyar and Medvedev 2008;]. [Boyar and Kudahl 2018] presents results which apply to the independent set problem and other problems, for different performance measures, including relative worst-order analysis.…”

Section: Other Online Problemsmentioning

confidence: 99%

Relative Worst-order Analysis

2021

Self Cite

View full text Add to dashboard Cite

The standard measure for the quality of online algorithms is the competitive ratio. This measure is generally applicable, and for some problems it works well, but for others it fails to distinguish between algorithms that have very different performance. Thus, ever since its introduction, researchers have worked on improving the measure, defining variants, or defining measures based on other concepts to improve on the situation. Relative worst-order analysis (RWOA) is one of the most thoroughly tested such proposals. With RWOA, many separations of algorithms not obtainable with competitive analysis have been found. In RWOA, two algorithms are compared directly, rather than indirectly as is done in competitive analysis, where both algorithms are compared separately to an optimal offline algorithm. If, up to permutations of the request sequences, one algorithm is always at least as good and sometimes better than another, then the first algorithm is deemed the better algorithm by RWOA. We survey the most important results obtained with this technique and compare it with other quality measures. The survey includes a quite complete set of references.

show abstract

Section: Other Online Problemsmentioning

confidence: 99%