TY - GEN A1 - Günther, Elisabeth A1 - Maurer, Olaf A1 - Megow, Nicole A1 - Wiese, Andreas T1 - A New Approach to Competitive Analysis: Approximating the Optimal Competitive Ratio N2 - We propose a new approach to competitive analysis by introducing the novel concept of online approximation schemes. Such scheme algorithmically constructs an online algorithm with a competitive ratio arbitrarily close to the best possible competitive ratio for any online algorithm. We study the problem of scheduling jobs online to minimize the weighted sum of completion times on parallel, related, and unrelated machines, and we derive both deterministic and randomized algorithms which are almost best possible among all online algorithms of the respective settings. Our method relies on an abstract characterization of online algorithms combined with various simplifications and transformations. We also contribute algorithmic means to compute the actual value of the best possible competitive ratio up to an arbitrary accuracy. This strongly contrasts all previous manually obtained competitiveness results for algorithms and, most importantly, it reduces the search for the optimal competitive ratio to a question that a computer can answer. We believe that our method can also be applied to many other problems and yields a completely new and interesting view on online algorithms. KW - competitive analysis KW - approximation scheme KW - online scheduling KW - sum of weighted completion times Y1 - 2012 UR - https://opus4.kobv.de/opus4-matheon/frontdoor/index/index/docId/943 UR - https://nbn-resolving.org/urn:nbn:de:0296-matheon-9433 ER -