Mostrar el registro sencillo del ítem
Approximation bounds for Black Hole Search problems
hal.structure.identifier | Algorithmics for computationally intensive applications over wide scale distributed platforms [CEPAGE] | |
hal.structure.identifier | Laboratoire Bordelais de Recherche en Informatique [LaBRI] | |
dc.contributor.author | KLASING, Ralf | |
hal.structure.identifier | Department of Informatics and Telecomunications [Kapodistrian Univ] [DI NKUA] | |
dc.contributor.author | MARKOU, Euripides | |
hal.structure.identifier | Department of Computer Science [DCS] | |
dc.contributor.author | RADZIK, Tomasz | |
hal.structure.identifier | Dipartimento di Informatica e Sistemistica "Antonio Ruberti" [DIS] | |
dc.contributor.author | SARRACCO, Fabiano | |
dc.date.accessioned | 2024-04-15T09:56:44Z | |
dc.date.available | 2024-04-15T09:56:44Z | |
dc.date.issued | 2007 | |
dc.identifier.uri | https://oskar-bordeaux.fr/handle/20.500.12278/198861 | |
dc.description.abstractEn | 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. | |
dc.language.iso | en | |
dc.title.en | Approximation bounds for Black Hole Search problems | |
dc.type | Rapport | |
dc.subject.hal | Informatique [cs]/Réseaux et télécommunications [cs.NI] | |
bordeaux.hal.laboratories | Laboratoire Bordelais de Recherche en Informatique (LaBRI) - UMR 5800 | * |
bordeaux.institution | Université de Bordeaux | |
bordeaux.institution | Bordeaux INP | |
bordeaux.institution | CNRS | |
bordeaux.type.institution | INRIA | |
bordeaux.type.report | rr | |
hal.identifier | inria-00145157 | |
hal.version | 1 | |
hal.audience | Non spécifiée | |
hal.origin.link | https://hal.archives-ouvertes.fr//inria-00145157v1 | |
bordeaux.COinS | ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.date=2007&rft.au=KLASING,%20Ralf&MARKOU,%20Euripides&RADZIK,%20Tomasz&SARRACCO,%20Fabiano&rft.genre=unknown |
Archivos en el ítem
Archivos | Tamaño | Formato | Ver |
---|---|---|---|
No hay archivos asociados a este ítem. |