Budgeted sensor placement for source localization on trees

DOI10.1016/J.ENDM.2015.07.012zbMATH Open1347.05030OpenAlexW2206179665MaRDI QIDQ324722FDOQ324722

Authors L. Elisa Celis, F. Pavetić, B. Spinelli, P. Thiran

Publication date 17 October 2016

Full work available at URL https://doi.org/10.1016/j.endm.2015.07.012

zbMATH Keywords

double resolvabilitysensor placementsource localization

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Discrete sensor placement problems in distribution networks
• Approximation for the minimum cost doubly resolving set problem
• Source localization and sensor placement in environmental monitoring
• Sequential localization of sensor networks
• scientific article; zbMATH DE number 1978154

Cites work

• Approximability of the minimum weighted doubly resolving set problem
• On the Metric Dimension of Cartesian Products of Graphs
• Rumors in a Network: Who's the Culprit?

Cited in

(6)

• Metric-locating-dominating sets of graphs for constructing related subsets of vertices
• Metric dimension of critical Galton-Watson trees and linear preferential attachment trees
• Source detection on graphs
• Approximability of the minimum weighted doubly resolving set problem
• Source localization and sensor placement in environmental monitoring
• Discrete sensor placement problems in distribution networks

This page was built for publication: Budgeted sensor placement for source localization on trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q324722)