Efficient Sample Location Selection for Query Zone in Geo-Social Networks

Algorithm 3

Continuous sample location selection.

Input: a set of anchor points, existing sample locations, and a positive integer ;

Output: the value of optimal solution ;

1: repeat

2: Calculate the distance vector ;

3: Sort in decreasing order, and refine the index of anchor points to make ;

4: Set , ;

5: while do

6: Set ;

7: Calculate ;

8: if then

9: Set ;

10: end if

11: if then

12: Set ;

13: end if

14: end while

15: Calculate the value of optimal solution of CFLS: ;

16: until no more sample locations are added

17: return the value of optimal solution ;