Computational geometry: an introduction
Computational geometry: an introduction
Planar point location using persistent search trees
Communications of the ACM
Slowing down sorting networks to obtain faster sorting algorithms
Journal of the ACM (JACM)
On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
Discrete & Computational Geometry
Optimal point location in a monotone subdivision
SIAM Journal on Computing
Visibility and intersection problems in plane geometry
Discrete & Computational Geometry
Obnoxious facility location on graphs
SIAM Journal on Discrete Mathematics
An O(n log n) algorithm for a maxmin location problem
Discrete Applied Mathematics
An efficient parallel algorithm for the row minima of a totally monotone matrix
Journal of Algorithms
Fast randomized parallel methods for planar convex hull construction
Computational Geometry: Theory and Applications
Applying Parallel Computation Algorithms in the Design of Serial Algorithms
Journal of the ACM (JACM)
Packing two disks in a polygon
Computational Geometry: Theory and Applications
Algorithms for Packing Two Circles in a Convex Polygon
JCDCG '98 Revised Papers from the Japanese Conference on Discrete and Computational Geometry
Operations Research Letters
An O(mn2) algorithm for the Maximin problem in E2
Operations Research Letters
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Maximizing the number of obnoxious facilities to locate within a bounded region
Computers and Operations Research
On the remoteness function in median graphs
Discrete Applied Mathematics
SIAM Journal on Discrete Mathematics
On the ordered anti-Weber problem for any norm in R2
Operations Research Letters
| Hi-index | 0.00 |
Given are a finite set of points P and a compact polygonal set S in R^2. The problem is to locate two new facilities in S, maximizing the minimum of all weighted distances between the points in P and the two new facilities, and the distance between the pair of new facilities. We present subquadratic algorithms.