Algorithm 1 GreedyDLDT Input: L, T, k Output: A set $L_0$ of selected sensor locations

1:$L_0=\varnothing$; 2:while $L_0$ does not k-cover T do 3: $l^{\ast }=\underset{l\in L-L_0}{argmax}(|U(l,T,L_0)|)$; 4: $L_0=\left\{l^{\ast }\right\}\cup L_0$; 5:return $L_0$;