Approximating minimum independent dominating sets in wireless networks

Authors:
Johann L. Hurink;Tim Nieberg
Affiliations:
University of Twente, Faculty of Electrical Engineering, Mathematics and Computer Science, Postbus 217, NL-7500 AE Enschede, The Netherlands;Research Institute for Discrete Mathematics, University of Bonn, Lennéstr. 2, D-53113 Bonn, Germany
Venue:
Information Processing Letters
Year:
2008

Citing 11
Cited 1

Unit disk graphs

Discrete Mathematics - Topics on domination
Approximating the minimum maximal independence number

Information Processing Letters
NC-approximation schemes for NP- and PSPACE-hard problems for geometric graphs

Journal of Algorithms
Unit disk graph recognition is NP-hard

Computational Geometry: Theory and Applications - Special issue on geometric representations of graphs
Intersection Graphs of Noncrossing Arc-Connected Sets in the Plane

GD '96 Proceedings of the Symposium on Graph Drawing
Polynomial-time approximation schemes for packing and piercing fat objects

Journal of Algorithms
Ad-hoc networks beyond unit disk graphs

DIALM-POMC '03 Proceedings of the 2003 joint workshop on Foundations of mobile computing
Robust algorithms for restricted domains

Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms
Polynomial-Time Approximation Schemes for Geometric Intersection Graphs

SIAM Journal on Computing
A PTAS for the minimum dominating set problem in unit disk graphs

WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
A robust PTAS for maximum weight independent sets in unit disk graphs

WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science

Approximation algorithms for intersection graphs

APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques

Quantified Score

Hi-index	0.89

Visualization

Abstract

We present the first polynomial-time approximation scheme (PTAS) for the Minimum Independent Dominating Set problem in graphs of polynomially bounded growth which are used to model wireless communication networks. The approach presented yields a robust algorithm, that is, it accepts any undirected graph as input, and returns a (1+@e)-approximate minimum independent dominating set, or a certificate showing that the input graph does not satisfy the bounded growth property.