A Faster Distributed Approximation Scheme for the Connected Dominating Set Problem for Growth-Bounded Graphs.
Beat GfellerElias VicariPublished in: Ad Hoc Sens. Wirel. Networks (2008)
Keyphrases
- connected dominating set
- dominating set
- polynomial time approximation
- distributed systems
- approximation schemes
- polynomial approximation
- closed form
- communication cost
- graph theoretic
- peer to peer
- pruning power
- continuous functions
- facility location problem
- rights management
- decision making
- computer networks
- multi objective
- cooperative