Approximation Bounds for Black Hole Search Problems.
Ralf KlasingEuripides MarkouTomasz RadzikFabiano SarraccoPublished in: OPODIS (2005)
Keyphrases
- search problems
- black hole
- cooperative
- orders of magnitude
- search algorithm
- heuristic search
- lower bound
- search strategies
- iterative deepening
- search space
- upper bound
- heuristic search algorithms
- approximation algorithms
- constraint satisfaction problems
- probabilistic model
- mobile agents
- search strategy
- network topologies
- machine learning