Near-Optimal Dominating Sets via Random Sampling

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...

Full description

Saved in:
Bibliographic Details
Published inAlgorithmic Aspects in Information and Management Vol. 9778; pp. 162 - 172
Main Author Nehéz, Martin
Format Book Chapter
LanguageEnglish
Published Switzerland Springer International Publishing AG 2016
Springer International Publishing
SeriesLecture Notes in Computer Science
Subjects
Approximation Ratio
Discrete mathematics
Domination Number
Exact Algorithm
Minimum Cardinality
Time Complexity
Online AccessGet full text

Cover

More Information
Summary: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 networks from a control theory perspective, the main result of this paper is the assertion that a random sampling is usable to find a near-optimal dominating set in an arbitrary connected graph. Our result might be of significance in particular contexts where exact algorithms cannot be run, e.g. in distributed computation environments. Moreover, the analysis of the relationship between the time complexity and the approximation ratio of the corresponding sequential algorithm exposes the counterintuitive behavior.
ISBN:9783319411675
3319411675
ISSN:0302-9743
1611-3349
DOI:10.1007/978-3-319-41168-2_14