Near-Optimal Dominating Sets via Random Sampling

• Published in: Algorithmic Aspects in Information and Management Vol. 9778; pp. 162 - 172
• Main Author: Nehéz, Martin
• Format: Book Chapter
• Language: English
• Published: Switzerland Springer International Publishing AG 2016; Springer International Publishing
• Series: Lecture Notes in Computer Science
• Subjects: Approximation Ratio; Discrete mathematics; Domination Number; Exact Algorithm; Minimum Cardinality; Time Complexity

A minimum dominating set (MDS) of a simple undirected graph G is a dominating set with the smallest possible cardinality among all dominating sets of G and the MDS problem represents the problem of finding the MDS in a given input graph. Motivated by the transportation, social and biological network...