On the rectangular p-center problem |
| |
| Authors: | Zvi Drezner |
| |
| Institution: | School of Business Administration and Economics, California State University at Fullerton, Fullerton, California 92634 |
| |
| Abstract: | The p-center problem involves finding the best locations for p facilities such that the furthest among n points is as close as possible to one of the facilities. Rectangular (sometimes called rectilinear, Manhattan, or l1) distances are considered. An O(n) algorithm for the 1-center problem, an O(n) algorithm for the 2-center problem, and an O(n logn) algorithm for the 3-center problem are given. Generalizations to general p-center problems are also discussed. |
| |
| Keywords: | |
|
|
