| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1143229 | Operations Research Letters | 2007 | 7 Pages |
Abstract
Let P be a simple rectilinear polygon with n vertices. There are k points in P. The maxian problem is to locate a single facility in P so as to maximize the sum of its distance from it to the k points. We present an O((nÃk)logn) time algorithm for this problem.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
D.P. Wang,