On the approximability and hardness of the minimum connected dominating set with routing cost constraint.
Tung-Wei KuoPublished in: Theor. Comput. Sci. (2019)
Keyphrases
- connected dominating set
- dominating set
- minimum cost
- facility location problem
- approximation algorithms
- np hard
- routing problem
- network topology
- maximum lifetime
- routing decisions
- constraint violations
- cost sensitive
- ad hoc networks
- genetic algorithm
- total cost
- routing protocol
- np complete
- phase transition
- multi criteria
- multistage
- fuzzy logic
- search algorithm