Slowing down sorting networks to obtain faster sorting algorithms
Journal of the ACM (JACM)
A linear-time algorithm for computing the Voronoi diagram of a convex polygon
Discrete & Computational Geometry
Applications of random sampling in computational geometry, II
Discrete & Computational Geometry - Selected papers from the fourth ACM symposium on computational geometry, Univ. of Illinois, Urbana-Champaign, June 6 8, 1988
Rectilinear and polygonal p-piercing and p-center problems
Proceedings of the twelfth annual symposium on Computational geometry
Approximation algorithms for NP-hard problems
Approximation algorithms for NP-hard problems
Efficient algorithms for geometric optimization
ACM Computing Surveys (CSUR)
Faster construction of planar two-centers
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
More planar two-center algorithms
Computational Geometry: Theory and Applications
Algorithms for facility location problems with outliers
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Low-Dimensional Linear Programming with Violations
SIAM Journal on Computing
On the bichromatic k-set problem
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
An Efficient Algorithm for 2D Euclidean 2-Center with Outliers
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
An Efficient Algorithm for 2D Euclidean 2-Center with Outliers
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Data reduction for weighted and outlier-resistant clustering
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
| Hi-index | 0.00 |
For a set Pof npoints in 茂戮驴2, the Euclidean 2-center problem computes a pair of congruent disks of the minimal radius that cover P. We extend this to the (2,k)-center problem where we compute the minimal radius pair of congruent disks to cover n茂戮驴 kpoints of P. We present a randomized algorithm with O(nk7log3n) expected running time for the (2,k)-center problem. We also study the (p,k)-center problem in 茂戮驴2under the 茂戮驴茂戮驴-metric. We give solutions for p= 4 in O(kO(1)nlogn) time and for p= 5 in O(kO(1)nlog5n) time.