Originally Posted by

**yaso** In cellular planning, we have to list the set of available locations for BS. And in any radio network design (RND) we need to maximize the coverage and minimize the # of used BS. So, if we denote the set of all possible available BS locations by M, and set of all potentially covered locations by L. In order to meet our objective we are searching for M' that belongs to M such that |M'| is minimum and such that |Neighbors(M',E)| is maximum, where Neighbors(M',E)= {u belongs to L| there exists v that belongs to M', (u,v) belong to E}.

So, my question is that how can we explain the last equation and what do we mean by neighbors as a function of M' and E ??

thanks.