Research Article
Social-Aware Task Allocation in Mobile Crowd Sensing
Algorithm 2
Fast greedy selection algorithm (FGS).
Input: : social network, : seed set size, | : task set, : candidate seeds. | Output: a set of seeds. | 1: , flag = False | 2: while and flag == False do | 3: for do | 4: | 5: if then | 6: flag = True; | 7: break; | 8: end if | 9: ; | 10: end for | 11: delete the completed tasks from ; | 12: end while | 13: if then | 14: ; | 15: ; | 16: end if | 17: return ; |
|