A Faster Distributed Approximation Scheme for the Connected Dominating Set Problem for Growth-Bounded Graphs.
Beat GfellerElias VicariPublished in: ADHOC-NOW (2007)
Keyphrases
- connected dominating set
- dominating set
- distributed systems
- polynomial time approximation
- facility location problem
- cooperative
- approximation algorithms
- pruning power
- distributed environment
- randomized approximation
- graph matching
- error bounds
- communication cost
- continuous functions
- numerical scheme
- approximation schemes
- graph theoretic
- rights management
- bayesian networks
- mobile agents
- evolutionary algorithm
- multi agent