Relative worst-order analysis: A survey

Joan Boyar*, Lene M Favrholdt, Kim S Larsen

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingBook chapterResearchpeer-review

66 Downloads (Pure)

Abstract

Relative worst-order analysis is a technique for assessing the relative quality of online algorithms. We survey the most important results obtained with this technique and compare it with other quality measures.

Original languageEnglish
Title of host publicationAdventures Between Lower Bounds and Higher Altitudes : Essays Dedicated to Juraj Hromkovič on the Occasion of His 60th Birthday
EditorsHans-Joachim Böckenhauer, Dennis Komm, Walter Unger
PublisherSpringer
Publication date2018
Edition1.
Pages216-230
ISBN (Print)9783319983547
ISBN (Electronic)9783319983554
DOIs
Publication statusPublished - 2018
SeriesLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume11011 LNCS
ISSN0302-9743

Fingerprint

Dive into the research topics of 'Relative worst-order analysis: A survey'. Together they form a unique fingerprint.

Cite this