Approximation bounds for Black Hole Search problems - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2007

Approximation bounds for Black Hole Search problems


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 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 any constant factor less than 389/388 (unless PTIME=NPTIME). 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.
Fichier principal
Vignette du fichier
RR-6185.pdf (232.53 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00145157 , version 1 (08-05-2007)
inria-00145157 , version 2 (09-05-2007)


  • HAL Id : inria-00145157 , version 2


Ralf Klasing, Euripides Markou, Tomasz Radzik, Fabiano Sarracco. Approximation bounds for Black Hole Search problems. [Research Report] RR-6185, INRIA. 2007. ⟨inria-00145157v2⟩
219 View
260 Download


Gmail Facebook X LinkedIn More