On the Approximability and Hardness of the Minimum Connected Dominating Set with Routing Cost Constraint.
Tung-Wei KuoPublished in: ALGOSENSORS (2018)
Keyphrases
- connected dominating set
- dominating set
- minimum cost
- approximation algorithms
- facility location problem
- routing protocol
- ad hoc networks
- routing decisions
- network topology
- np hard
- computational complexity
- cost sensitive
- worst case
- multistage
- bayesian networks
- response time
- total cost
- sensor networks
- wireless sensor networks
- lower bound