Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

NETWORKS
2008

favoriteEmaildiscussreport

142views Computer Networks» more NETWORKS 2008»

Approximation bounds for Black Hole Search problems

13 years 4 months ago

Approximation bounds for Black Hole Search problems

Download hal.archives-ouvertes.fr

Ralf Klasing, Euripides Markou, Tomasz Radzik, Fab

Real-time Traffic

Computer Networks | NETWORKS 2008 |

claim paper

Related Content

» Searching for a Black Hole in Tree Networks

» Improved Bounds for Optimal Black Hole Search with a Network Map

» Time Optimal Algorithms for Black Hole Search in Rings

» Multiple Agents RendezVous in a Ring in Spite of a Black Hole

» The BlackBox Complexity of Nearest Neighbor Search

» Quantum Search of Spatial Regions

» Lower bounds for approximate polygon decomposition and minimum gap

» BlackBox Randomized Reductions in Algorithmic Mechanism Design

» On exact and approximate interpolation of sparse rational functions

Post Info
More Details (n/a)

Added	14 Dec 2010
Updated	14 Dec 2010
Type	Journal
Year	2008
Where	NETWORKS
Authors	Ralf Klasing, Euripides Markou, Tomasz Radzik, Fabiano Sarracco

Comments (0)