Dr. Frankenstein’s Approach to On-line Algorithms (Extended abstract)
Download:
by Yossi Azar, Andrei Z. Broder, Mark S. Manasse
http://www.std.org/~msm/common/choice.pdf
Add To MetaCart
Abstract:
Let {A1, A2,..., Am} be a set of on-line algorithms for a problem P with input set I. We assume that P can be represented as a metrical task system. Each Ai has a competitive ratio ai with respect to the optimum off-line algorithm, but only for a subset of the possible inputs such that the union of these subsets covers I. Given this setup, we construct a generic deterministic on-line algorithm and a generic randomized on-line algorithm for P that are competitive over all possible inputs. We show that their competitive ratios are optimal up to constant factors. Our analysis proceeds via an amusing card game.
Citations
| 642 | Amortized efficiency of list update and paging rules – Sleator, Tarjan - 1985 |
| 166 | An optimal online algorithm for metrical task systems – Borodin, Linial, et al. - 1992 |
| 158 | Competitive paging algorithms – Fiat, Karp, et al. - 1991 |
| 134 | Shortest paths without a map – Papadimitriou, Yannakakis - 1991 |
| 50 | Competitive k-server algorithms – FIAT, RABANI, et al. - 1990 |
| 25 | Competitive algorithms for layered graph traversal – Fiat, Foster, et al. - 1991 |
