• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.6
• /
• pp.340-345
• /
• 2002

In this paper, we deal with the following facility location problem. Given a set P of n points in the plane, find two (discrete) centers p and q in P that minimize the sum of there distance plus the distance of any other point to the closer center. In this paper, we propose an Ο(n$^2$1ogn)-time algorithm to compute the two centers.