Advice Complexity for a Class of Online Problems

@inproceedings{Boyar2015AdviceCF,
  title={Advice Complexity for a Class of Online Problems},
  author={Joan Boyar and Lene M. Favrholdt and Christian Kudahl and Jesper W. Mikkelsen},
  booktitle={STACS},
  year={2015}
}
The advice complexity of an online problem is a measure of how much knowledge of the future an online algorithm needs in order to achieve a certain competitive ratio. We determine the advice complexity of a number of hard online problems including independent set, vertex cover, dominating set and several others. These problems are hard, since a single wrong answer by the online algorithm can have devastating consequences. For each of these problems, we show that log ( 1 + (c−1) c−1 cc ) n = Θ(n… CONTINUE READING

Similar Papers

Loading similar papers…