Algorithm 1 Greedy algorithm for MCLB problem

Require: Sampling points set P; participants set V and corresponding rewards set $B_V$; the selected participants set $S=\varnothing$; total rewards of selected participants $R=0$; limited budget B; Ensure: The set of selected participants S, the coverage quality W of this case; 1: For all $v_iϵV$ do; 2: if $b_i>B$; 3: $V⟵$$V\backslash$$v_i$; 4: For all $v_iϵV$ do; 5: $e_i$=$y_i/b_i$; 6: select $v_{max}ϵV$ with maximum $e_{max}$; 7: $S=S\cup \left\{v_{max}\right\}$; 8: $R=R+b_{max}$; 9: repeat 10:     $V⟵V\backslash v_{max}$; 11:     if $b_i\le (B-R)$ 12:     select $v_iϵV$ with maximum $\frac{y_i-y_{common}}{b_i}$; 13:     $S=S\cup \left\{v_i\right\}$; 14:     $R=R+b_i$; 15: until $W=1$ or $R\ge B$ or $V=\varnothing$;