A Cross-Entropy Approach to the Domination Problem and Its Variants.

The domination problem and three of its variants (total domination, 2-domination, and secure domination) are considered. These problems have various real-world applications, including error correction codes, ad hoc routing for wireless networks, and social network analysis, among others. However, each of them is NP-hard to solve to provable optimality, making fast heuristics for these problems desirable.