A New Greedy Algorithm for D-Hop Connected Dominating Set.
Xianyue LiXiaofeng GaoChenxia ZhaoPublished in: MSN (2014)
Keyphrases
- greedy algorithm
- connected dominating set
- dominating set
- greedy algorithms
- worst case
- facility location problem
- objective function
- greedy strategy
- set cover
- dynamic programming
- greedy heuristic
- influence maximization
- submodular functions
- knapsack problem
- randomized algorithm
- column generation
- approximation algorithms
- upper bound
- lower bound