2023/09/15 by Ryan Burdett, Burdett, Ryan, Michael Haythorpe +3
Computer Science · Decision Sciences · Economics, Econometrics and Finance · #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Game Theory and Applications #Game Theory and Voting Systems #Optimization and Control (math.OC)
paper · pdf · doi:10.48550/arxiv.2309.08192
openalex publication_date 2023/09/15 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
The domination problem and several of its variants (total domination, 2-domination and secure domination) are considered. These problems have various real-world applications, but are NP-hard to solve to provable optimality, making fast heuristics for these problems desirable. There is a wealth of highly-developed heuristics and approximation algorithms for the domination problem, however such heuristics are much less common for variants of the domination problem. We redress this by proposing an implementation of the cross entropy method that can be applied to any sensible variant of domination. We present results from experiments which demonstrate that this approach can produce good results in an efficient manner even for larger graphs, and that it works roughly as well for any of the domination variants considered.