An O(n) algorithm for the linear multiple choice knapsack problem and related problems
Information Processing Letters
Computational geometry: an introduction
Computational geometry: an introduction
Power diagrams: properties, algorithms and applications
SIAM Journal on Computing
An improved algorithm for constructing kth-order voronoi diagrams
IEEE Transactions on Computers
Spatial tessellations: concepts and applications of Voronoi diagrams
Spatial tessellations: concepts and applications of Voronoi diagrams
The k-centrum multi-faculty location problem
Discrete Applied Mathematics
Minimizing the sum of the k largest functions in linear time
Information Processing Letters
Apollonius Tenth Problem as a Point Location Problem
ICCS '01 Proceedings of the International Conference on Computational Sciences-Part I
An algorithm for polygon clipping, and for determining polygon intersections and unions
Computers & Geosciences
A general model for the undesirable single facility location problem
Operations Research Letters
Algorithmic results for ordered median problems
Operations Research Letters
On the ordered anti-Weber problem for any norm in R2
Operations Research Letters
The ordered anti-median problem with distances derived from a strictly convex norm
Discrete Applied Mathematics
| Hi-index | 0.01 |
An obnoxious facility is to be located inside a polygonal region of the plane, maximizing the sum of the k smallest weighted Euclidean distances to n given points, each protected by some polygonal forbidden region. For the unweighted case and k fixed an O(n^2logn) time algorithm is presented. For the weighted case a thorough study of the relevant structure of the multiplicatively weighted order-k-Voronoi diagram leads to the design of an O(kn^3+n^3logn) time algorithm for finding an optimal solution to the anti-t-centrum problem for every t=1,...,k, simultaneously.