We provide an approximation
algorithm for selecting centers in a complete graph so as to minimize the
maximum ratio of the distance between any two nodes via their respective
centers to their true graph distance. Placing centers under such an objective
function is important in designing efficient communication networks which rely
on hubs for routing.