Relative Worst-Order Analysis: A Survey

A Borodin; A Borodin; A Gyárfás; AR Karlin; B Kalyanasundaram; B Teia; C Fischer; CJ Osborn; DA Spielman; DD Sleator; DS Johnson; DS Johnson; E Koutsoupias; EG Coffmand Jr; H-J Böckenhauer; J Boyar; J Boyar; J Boyar; J Boyar; J Boyar; J Boyar; J Boyar; J Boyar; J Boyar; J Boyar; J Boyar; J Boyar; J Boyar; J Boyar; J Boyar; J Hromkovič; J McCabe; JL Bentley; L Epstein; L Epstein; M Babaioff; M Chrobak; M Chrobak; MG Christ; MR Ehmsen; NE Young; O Göbel; PJ Denning; PJ Denning; R Dorrigiv; RL Graham; S Albers; S Albers; S Albers; S Albers; S Ben-David; S Dobrev; S Irani; SO Krumke

research

Relative Worst-Order Analysis: A Survey

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.Comment: 20 page

Similar works

Full text

Open in the Core reader

Download PDF

Available Versions

Syddansk Universitets Forskerportal

oai:sdu.dk:openaire_cris_publi...

Last time updated on 17/11/2024

Syddansk Universitets Forskerportal

oai:sdu.dk:publications/9d062d...

Last time updated on 17/11/2024

University of Southern Denmark Research Output

oai:pure.atira.dk:publications...

Last time updated on 30/09/2018

Syddansk Universitets Forskerportal

oai:sdu.dk:openaire/9d062d7c-8...

Last time updated on 19/10/2025

Crossref

Last time updated on 22/07/2021