Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
26
click to vote
NETWORKS
2008
favorite
Email
discuss
report
142
views
Computer Networks
»
more
NETWORKS 2008
»
Approximation bounds for Black Hole Search problems
13 years 8 months ago
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
more »
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)
Researcher Info
Computer Networks Study Group
Computer Vision