Weighted domination models and randomized heuristics

Lukas Dijkstra, Andrei Gagarin, Vadim Zverovich

We consider the minimum weight and smallest weight minimum-size dominating set problems in vertex-weighted graphs and networks. The latter problem is a two-objective optimization p…