Discrete Event Systems Solution to Exercise Sheet 8 1 Competitive Analysis Competitive Analysis

@inproceedings{Brandt2016DiscreteES,
  title={Discrete Event Systems Solution to Exercise Sheet 8 1 Competitive Analysis Competitive Analysis},
  author={Ronald S. Brandt},
  year={2016}
}
The competitive analysis of an algorithm Alg consists of two separate steps. First, we show that for an arbitrary problem instance, the result of Alg is asymptotically at most a factor r worse than the the optimal offline result. This yields an upper bound on Alg’s result, that is costAlg ≤ r · costOpt + c. If the task is to show that Alg is constant-competitive for a constant r, then we are done. If we are interested in a tight analysis, we have to show that there is a problem instance where… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Similar Papers

Loading similar papers…