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

Algorithm 2

1-center problem algorithm.

Input: a set of anchor points;

Output: the optimal center point and ;

1: choose the initial center point , where , ;

2: the three points that are farthest from ;

3: while there exists a point in such that the distance between it and is larger than do

4: the farthest point from ;

5: ;

6: end while

7: return and ;