Algorithm 4 t-RF Selection of influential users and locations.

Input: LBSN: $〈G,L〉$; Query: $(R,k,m,q)$      Output: S-seeds, V-locations 1      $I\leftarrow$ 10,000                 ▹ Number of Simulations      for all locations l ∈ L do           if (l.city $==R$) and (l.category == q) then 4:        $L^{\prime }=L^{\prime }\cup \left\{l\right\}$ $G^{\prime }=(U^{\prime },E^{\prime })\mid \{U^{\prime }\subseteq U\wedge U^{\prime }\exists L^{\prime }\}$    ▹ Subgraph of users who checked in at location lying under target region $G^{″}\leftarrow G^{\prime }$ for all users u $\in U^{\prime }$ do 8:    for each neighbor v of u do         if (v not in $G^{″}$) then            $G^{″}=G^{″}\cup \left(v\right)$ $S\leftarrow DegreeDiscount(G^{″},k,I)$ 12:$L^{″}\subseteq L^{\prime }\mid \{S\exists L^{″}\}$ for$i\leftarrow 1:m$do     for all locations l $\in L^{″}$ do         $L_{UF}=ComputeLocationUserFreq\left(\mathit{l}\right)$ 16:    $V=V\cup \left\{{arg\; max}_{l\in L_{UF}\setminus V}\left\{L_{UF}\right\}\right\}$     $L^{\prime }=L^{\prime }-V$ Return $S,V$