An emergency management model for a wireless sensor network problem
Résumé
We present a natural wireless sensor network problem, which we model as a probabilistic version of the MIN DOMINATING SET problem. We show that this problem, being a generalization of the classical MIN DOMINATING SET, is NP-hard, even in bipartite graphs. We first study the complexity of probabilistic MIN DOMINATING SET in graphs where min dominating set is polynomial, mainly in trees and paths and then we give some approximation results for it.
Origine : Fichiers produits par l'(les) auteur(s)
Loading...