Showing math.COShow all
2 papers · 1 filter
math.CO2026
Approximation algorithms and ratios for multiple domination in graphs
Lukas Dijkstra, Vadim Zverovich, Andrei Gagarin
We analyse approximation algorithms (greedy heuristics) for the classical domination number and two multiple domination numbers in simple graphs. First, we present a short self-con…
math.CO2022
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…