Approximating minimum independent dominating sets in wireless networks
type: Item
instance of: scholarly article
title: Approximating minimum independent dominating sets in wireless networks
zbMATH Open document ID: 1191.68866
author: Johann L. Hurink
author: Tim Nieberg
published in: Information Processing Letters
publication date: 2010-06-09T00:00:00Z
full work available at URL: approximating-minimum-independent-dominating-sets-in-wireless-networks(cceb6e65-6203-4c0e-bb0d-5c9d4fe76d7e).html
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 5719258
zbMATH Keywords: approximation algorithms
zbMATH Keywords: PTAS
zbMATH Keywords: minimum independent dominating set
zbMATH Keywords: minimum maximal independent set
MaRDI profile type: Publication
OpenAlex ID: W2053372822
cites work: Unit disk graph recognition is NP-hard
cites work: Polynomial-time approximation schemes for packing and piercing fat objects
cites work: A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks
cites work: Unit disk graphs
cites work: Polynomial-Time Approximation Schemes for Geometric Intersection Graphs
cites work: Approximating the minimum maximal independence number
cites work: NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs
cites work: Geometric ad-hoc routing
cites work: Simple heuristics for unit disk graphs
cites work: Approximation and Online Algorithms
cites work: Graph-Theoretic Concepts in Computer Science
cites work: Robust algorithms for restricted domains
DOI: 10.1016/J.IPL.2008.09.021
Recommended article: A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks
Recommended article: MINIMUM CONNECTED r-HOP k-DOMINATING SET IN WIRELESS NETWORKS
Recommended article: MAXIMAL INDEPENDENT SET, WEAKLY-CONNECTED DOMINATING SET, AND INDUCED SPANNERS IN WIRELESS AD HOC NETWORKS
Recommended article: Finding a maximal weighted independent set in wireless networks
Recommended article: On approximating the minimum independent dominating set
Recommended article: On the construction of \(k\)-connected \(m\)-dominating sets in wireless networks
Recommended article: On minimum weakly connected independent sets for wireless sensor networks: properties and enumeration algorithm
description: scientific article; zbMATH DE number 5719258