M Centres -

Let ( P = p_1, p_2, \dots, p_n ) be a set of demand points in a metric space ( (X, d) ), where ( d ) is a distance metric (e.g., Euclidean, Manhattan, or shortest-path on a network). We wish to select a set ( C = c_1, c_2, \dots, c_m ) of ( m ) centre locations (not necessarily from ( P )).

For 5G base stations, the signal strength degrades with distance. The m-centre problem ensures no "dead zone" exceeds a maximum radius. This is especially critical for autonomous vehicle corridors. m centres