A New Greedy Algorithm for Constructing the Minimum Size Connected Dominating Sets in Wireless Networks.
Chuanwen LuoYongcai WangJiguo YuWenping ChenDeying LiPublished in: WASA (2017)
Keyphrases
- greedy algorithm
- wireless networks
- wireless communication
- greedy algorithms
- worst case
- mobile computing
- base station
- low bandwidth
- ad hoc networks
- greedy strategy
- multimedia services
- cellular networks
- access points
- objective function
- knapsack problem
- set cover
- wired networks
- randomized algorithm
- wireless ad hoc networks
- dynamic programming
- greedy heuristic
- wireless technologies
- network coding
- mobile wireless
- mobile networks
- minimum cost
- influence maximization
- video delivery
- computational complexity