TY - BOOK
T1 - Approximating minimum independent dominating sets in wireless networks
AU - Hurink, Johann L.
AU - Nieberg, Tim
PY - 2007/2/15
Y1 - 2007/2/15
N2 - We present the first polynomial-time approximation scheme (PTAS) for the Minimum Independent Dominating Set problem in graphs of polynomially bounded growth. Graphs of bounded growth are used to characterize wireless communication networks, and this class of graph includes many models known from the literature, e.g. (Quasi) Unit Disk Graphs. An independent dominating set is a dominating set in a graph that is also independent. It thus combines the advantages of both structures, and there are many applications that rely on these two structures e.g. in the area of wireless ad hoc networks.
The presented approach yields a robust algorithm, that is, the algorithm accepts any undirected graph as input, and returns a $(1+\varepsilon )$-approximate minimum dominating set, or a certificate showing that the input graph does not reflect a wireless network.
AB - We present the first polynomial-time approximation scheme (PTAS) for the Minimum Independent Dominating Set problem in graphs of polynomially bounded growth. Graphs of bounded growth are used to characterize wireless communication networks, and this class of graph includes many models known from the literature, e.g. (Quasi) Unit Disk Graphs. An independent dominating set is a dominating set in a graph that is also independent. It thus combines the advantages of both structures, and there are many applications that rely on these two structures e.g. in the area of wireless ad hoc networks.
The presented approach yields a robust algorithm, that is, the algorithm accepts any undirected graph as input, and returns a $(1+\varepsilon )$-approximate minimum dominating set, or a certificate showing that the input graph does not reflect a wireless network.
KW - Approximation algorithms
KW - PTAS
KW - Minimum independent dominating set
KW - Minimum maximal independent set
M3 - Report
T3 - Memorandum
BT - Approximating minimum independent dominating sets in wireless networks
PB - University of Twente
CY - Enschede
ER -