A greedy algorithm for the fault-tolerant connected dominating set in a general graph.
Jiao ZhouZhao ZhangWeili WuKai XingPublished in: J. Comb. Optim. (2014)
Keyphrases
- greedy algorithm
- fault tolerant
- connected dominating set
- fault tolerance
- dominating set
- submodular functions
- distributed systems
- facility location problem
- greedy algorithms
- worst case
- special case
- load balancing
- knapsack problem
- set cover
- greedy heuristic
- objective function
- randomized algorithm
- greedy strategy
- random walk