An emergency management model for a wireless sensor network problem
dc.contributor.author | Boria, Nicolas
HAL ID: 21013 ORCID: 0000-0002-0548-4257 | |
dc.contributor.author | Murat, Cécile | |
dc.contributor.author | Paschos, Vangelis | |
dc.date.accessioned | 2012-11-21T10:32:54Z | |
dc.date.available | 2012-11-21T10:32:54Z | |
dc.date.issued | 2012 | |
dc.identifier.uri | https://basepub.dauphine.fr/handle/123456789/10608 | |
dc.language.iso | en | en |
dc.subject | wireless sensor network | |
dc.subject | Min dominating set | |
dc.subject.ddc | 003 | en |
dc.title | An emergency management model for a wireless sensor network problem | |
dc.type | Document de travail / Working paper | |
dc.description.abstracten | We present a natural wireless sensor network problem, which we model as a probabilisticversion 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 firststudy the complexity of probabilistic min dominating set in graphs where min dominatingset is polynomial, mainly in trees and paths and then we give some approximationresults for it. | |
dc.publisher.city | Paris | en |
dc.relation.ispartofseriestitle | Cahier du LAMSADE | |
dc.subject.ddclabel | Recherche opérationnelle | en |
dc.description.submitted | non | en |
dc.description.ssrncandidate | non | |
dc.description.halcandidate | oui | |
dc.description.readership | recherche | |
dc.description.audience | International | |
dc.date.updated | 2017-02-21T08:27:04Z |