Greedy heuristics

An iterated greedy algorithm for finding the minimum dominating set in graphs
A dominating set in a graph is a set of vertices such that every vertex outside the set is adjacent to a vertex in the set. The …
Cite DOI URL