An iterated greedy algorithm for finding the minimum dominating set in graphs.
Alejandra CasadoSergio BermudoA. D. López-SánchezJesús Sánchez-OroPublished in: Math. Comput. Simul. (2023)
Keyphrases
- greedy algorithm
- dominating set
- connected dominating set
- facility location problem
- greedy algorithms
- dynamic programming
- greedy approximation algorithm
- objective function
- greedy strategy
- greedy heuristic
- knapsack problem
- submodular functions
- worst case
- approximation guarantees
- facility location
- set cover
- approximation algorithms
- influence maximization
- influence spread
- randomized algorithm
- tabu search
- linear programming
- genetic algorithm