On the Approximability and Hardness of the Minimum Connected Dominating Set with Routing Cost Constraint.
Tung-Wei KuoPublished in: CoRR (2017)
Keyphrases
- connected dominating set
- dominating set
- minimum cost
- facility location problem
- approximation algorithms
- np hard
- total cost
- shortest path
- routing decisions
- routing protocol
- phase transition
- routing algorithm
- constraint violations
- routing problem
- network topology
- np complete
- computational complexity
- bayesian networks
- linear constraints
- multistage
- mathematical model
- special case