A greedy algorithm for the minimum 2-connected m-fold dominating set problem.

Yishuo Shi Yaping Zhang Zhao Zhang Weili Wu

Published in: J. Comb. Optim. (2016)

Keyphrases

greedy algorithm
dominating set
connected dominating set
facility location problem
greedy algorithms
worst case
objective function
greedy heuristic
influence maximization
set cover
knapsack problem
greedy strategy
greedy approximation algorithm
search algorithm
dynamic programming
influence spread