Approximation bounds for black hole search problems

  • Authors:

  • Ralf Klasing;Euripides Markou;Tomasz Radzik;Fabiano Sarracco

  • Affiliations:

  • LaBRI – Université Bordeaux 1, Talence, France;Department of Informatics and Telecommunications, National and Kapodistrian University of Athens;Department of Computer Science, King's College London, London, UK;Dipartimento di Informatica e Sistemistica, Università di Roma “La Sapienza”

  • Venue:
  • OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

A black hole is a highly harmful stationary process residing in a node of a network and destroying all mobile agents visiting the node without leaving any trace. The Black Hole Search is the task of locating all black holes in a network, through the exploration of its nodes by a set of mobile agents. In this paper we consider the problem of designing the fastest Black Hole Search, given the map of the network, the starting node and, possibly, a subset of nodes of the network initially known to be safe. We study the version of this problem that assumes that there is at most one black hole in the network and there are two agents, which move in synchronized steps. We prove that this problem is not polynomial-time approximable within $\frac{389}{388}$ (unless P=NP). We give a 6-approximation algorithm, thus improving on the 9.3-approximation algorithm from [3]. We also prove APX-hardness for a restricted version of the problem, in which only the starting node is initially known to be safe.