220673
20190117220218.0
10.1016/j.endm.2015.07.012
doi
CONF
Budgeted sensor placement for source localization on trees
2015
2015
Conference Papers
We address the problem of choosing a fixed number of sensor vertices in a graph in order to detect the source of a partially-observed diffusion process on the graph itself. Building on the definition of double resolvability we introduce a notion of vertex resolvability. For the case of tree graphs we give polynomial time algorithms for both finding the sensors that maximize the probability of correct detection of the source and for identifying the sensor set that minimizes the expected distance between the real source and the estimated one.
epidemics
source localization
sensor placement
Celis, Elisa
245193
248244
Pavetic, Filip
Spinelli, Brunella Marta
226024
247061
Thiran, Patrick
103925
240373
Latin-American Algorithms, Graphs and Optimization Symposium
Publisher's version
206104
Publisher's version
http://infoscience.epfl.ch/record/220673/files/1-s2.0-S1571065315001675-main.pdf
Extended version
359977
Extended version
http://infoscience.epfl.ch/record/220673/files/extended.pdf
LCA3
252454
U10431
oai:infoscience.tind.io:220673
IC
conf
226024
226024
226024
226024
226024
192636
226024
226024
EPFL-CONF-220673
EPFL
PUBLISHED
REVIEWED
CONF