Advice Complexity for a Class of Online Problems

Joan Boyar, Lene Monrad Favrholdt, Christian Kudahl, Jesper With Mikkelsen

Publikation: Kapitel i bog/rapport/konference-proceedingKonferencebidrag i proceedingsForskningpeer review

Abstract

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/c c n = Θ(n/c) bits of advice are necessary and sufficient (up to an additive term of O(log n)) to achieve a competitive ratio of c. This is done by introducing a new string guessing problem related to those of Emek et al. (TCS 2011) and Böckenhauer et al. (TCS 2014). It turns out that this gives a powerful but easy-to-use method for providing both upper and lower bounds on the advice complexity of an entire class of online problems. Previous results of Halldórsson et al. (TCS 2002) on online independent set, in a related model, imply that the advice complexity of the problem is Θ(n/c). Our results improve on this by providing an exact formula for the higher-order term. Böckenhauer et al. (ISAAC 2009) gave a lower bound of Ω(n/c) and an upper bound of O((n log c)/c) on the advice complexity of online disjoint path allocation. We improve on the upper bound by a factor of log c. For the remaining problems, no bounds on their advice complexity were previously known.

OriginalsprogEngelsk
Titel32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)
RedaktørerErnst W. Mayr, Nicolas Ollinger
Vol/bind30
ForlagSchloss Dagstuhl-Leibniz-Zentrum fuer Informatik
Publikationsdato2015
Sider116-129
ISBN (Elektronisk)978-3-939897-78-1
DOI
StatusUdgivet - 2015
Begivenhed32nd International Symposium on Theoretical Aspects of Computer Science - Technische Universität München, Garching, Tyskland
Varighed: 4. mar. 20157. mar. 2015

Konference

Konference32nd International Symposium on Theoretical Aspects of Computer Science
LokationTechnische Universität München
Land/OmrådeTyskland
ByGarching
Periode04/03/201507/03/2015
NavnLeibniz International Proceedings in Informatics
Vol/bind30
ISSN1868-8969

Emneord

  • online algorithms
  • advice complexity
  • string guessing
  • graph problems

Citationsformater