One algorithm of this type partitions a binary search tree into preferred paths and generates a tango tree. Another algorithm of this type, which is random and operates within a factor of twice the kth harmonic number of optimality, is the marking algorithm. That algorithm solves the paging problem, which is a specific case of the more general k-server problem tackled by these algorithms. They may be compared to either adaptive or oblivious adversaries, and their performance across all input cases is compared to an opti
One algorithm of this type partitions a binary search tree into preferred paths and generates a tango tree. Another algorithm of this type, which is random and operates within a factor of twice the kth harmonic number of optimality, is the marking algorithm. That algorithm solves the paging problem, which is a specific case of the more general k-server problem tackled by these algorithms. They may be compared to either adaptive or oblivious adversaries, and their performance across all input cases is compared to an optimal alternative in (*) competitive analysis. One of these algorithms tackles the ski rental problem, which concerns the choice between paying a small repeating cost or a large one-time cost. These algorithms must respond immediately to each request they receive. For 10 points, name this class of algorithms that receive input one piece at a time instead of having it all at the start.
One algorithm of this type partitions a binary search tree into preferred paths and generates a tango tree.
online algorithms