Tree exploration with advice

  • Authors:

  • Pierre Fraigniaud;David Ilcinkas;Andrzej Pelc

  • Affiliations:

  • CNRS and Université Paris Diderot, Paris 7, Case 7014, 75205 Paris, Cedex 13, France;CNRS and Université de Bordeaux, LaBRI, bât A30, 351 cours de la Libération, 33405 Talence Cedex, France;Université du Québec en Outaouais, Département d'informatique et d'ingénierie, C.P. 1250, succ. Hull, Gatineau, Quebec, Canada J8X 3X7

  • Venue:
  • Information and Computation
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

We study the amount of knowledge about the network that is required in order to efficiently solve a task concerning this network. The impact of available information on the efficiency of solving network problems, such as communication or exploration, has been investigated before but assumptions concerned availability of particular items of information about the network, such as the size, the diameter, or a map of the network. In contrast, our approach is quantitative: we investigate the minimum number of bits of information (bits of advice) that has to be given to an algorithm in order to perform a task with given efficiency. We illustrate this quantitative approach to available knowledge by the task of tree exploration. A mobile entity (robot) has to traverse all edges of an unknown tree, using as few edge traversals as possible. The quality of an exploration algorithm A is measured by its competitive ratio, i.e., by comparing its cost (number of edge traversals) to the length of the shortest path containing all edges of the tree. Depth-First-Search has competitive ratio 2 and, in the absence of any information about the tree, no algorithm can beat this value. We determine the minimum number of bits of advice that has to be given to an exploration algorithm in order to achieve competitive ratio strictly smaller than 2. Our main result establishes an exact threshold number of bits of advice that turns out to be roughly loglogD, where D is the diameter of the tree. More precisely, for any constant c, we construct an exploration algorithm with competitive ratio smaller than 2, using at most loglogD-c bits of advice, and we show that every algorithm using loglogD-g(D) bits of advice, for any function g unbounded from above, has competitive ratio at least 2.