Discrete sensor placement problems in distribution networks

Our main results are as follows. First, we give a necessary and sufficient condition for source identification.Second, we show that the sensor and time constrained versions of the problem are polynomially equivalent. Finally, we show that the sensor-constrained version of the problem is polynomially equivalent to the asymmetric k-center problem and that the time-constrained version of the problem is polynomially equivalent to the dominating set problem.