Approximation Bounds for Black Hole Search Problems

Klasing, R; Markou, E; Radzik, T; Sarracco, F

dc.contributor.author	Klasing, R	en
dc.contributor.author	Markou, E	en
dc.contributor.author	Radzik, T	en
dc.contributor.author	Sarracco, F	en
dc.date.accessioned	2014-03-01T02:49:56Z
dc.date.available	2014-03-01T02:49:56Z
dc.date.issued	2005	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/34808
dc.subject	Approximate Algorithm	en
dc.subject	Mobile Agent	en
dc.subject	Stationary Process	en
dc.subject	Black Hole	en
dc.title	Approximation Bounds for Black Hole Search Problems	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1007/11795490_21	en
heal.identifier.secondary	http://dx.doi.org/10.1007/11795490_21	en
heal.publicationDate	2005	en
heal.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	en
heal.journalName	International Conference On Principles Of DIstributed Systems	en
dc.identifier.doi	10.1007/11795490_21	en