Algorithm 1: $SelRep$

Input: locations of all the nodes $Locations$ and parameter $n$

Output: $n$ representations

1) while the number of clusters $> n$

2)    combine the nearest two clusters

3) end while

4) for each cluster

5)   select a representation of the cluster

6) end for