Relative Worst-order Analysis: A Survey

作者: Joan Boyar , Lene M. Favrholdt , Kim S. Larsen

DOI: 10.1145/3425910

关键词:

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

参考文章(98)
Joan Boyar, Kim S. Larsen, Abyayananda Maiti, A comparison of performance measures via online search Theoretical Computer Science. ,vol. 532, pp. 2- 13 ,(2014) , 10.1016/J.TCS.2013.07.022
Susanne Albers, Jeffery Westbrook, Self-Organizing Data Structures Lecture Notes in Computer Science. pp. 13- 51 ,(1998) , 10.1007/BFB0029563
Xin Han, Kazuhisa Makino, Online minimization knapsack problem Theoretical Computer Science. ,vol. 609, pp. 185- 196 ,(2016) , 10.1016/J.TCS.2015.09.021
Carsten Fischer, Heiko Röglin, Probabilistic Analysis of the Dual Next-Fit Algorithm for Bin Covering latin american symposium on theoretical informatics. pp. 469- 482 ,(2016) , 10.1007/978-3-662-49529-2_35
Susanne Albers, Sonja Lauer, On list update with locality of reference Journal of Computer and System Sciences. ,vol. 82, pp. 627- 653 ,(2016) , 10.1016/J.JCSS.2015.11.005
Oliver Göbel, Thomas Kesselheim, Andreas Tönnis, Online Appointment Scheduling in the Random Order Model european symposium on algorithms. pp. 680- 692 ,(2015) , 10.1007/978-3-662-48350-3_57
Albert Gu, Anupam Gupta, Amit Kumar, The Power of Deferral: Maintaining a Constant-Competitive Steiner Tree Online SIAM Journal on Computing. ,vol. 45, pp. 1- 28 ,(2016) , 10.1137/140955276
Joan Boyar, Kim S. Larsen, Abyayananda Maiti, The Frequent Items Problem in Online Streaming Under Various Performance Measures International Journal of Foundations of Computer Science. ,vol. 26, pp. 413- 439 ,(2015) , 10.1142/S0129054115500239
Nicole Megow, Martin Skutella, José Verschae, Andreas Wiese, The Power of Recourse for Online MST and TSP SIAM Journal on Computing. ,vol. 45, pp. 859- 880 ,(2016) , 10.1137/130917703
Hans-Joachim Böckenhauer, Dennis Komm, Rastislav Královič, Richard Královič, Tobias Mömke, Online algorithms with advice: The tape model Information & Computation. ,vol. 254, pp. 59- 83 ,(2017) , 10.1016/J.IC.2017.03.001