Assigning Weights to Minimize the Covering Radius in the Plane

Given a set P of n points in the plane and a multiset W of k weights with k leq n, we assign a weight in W to a point in P to minimize the maximum weighted distance from the weighted center of P to any point in P. In this paper, we give two algorithms which take O(k^2 n^2 log^4 n) time and O(k^5 n log^4 k + kn log^3 n) time, respectively. For a constant k, the second algorithm takes only O(n log^3 n) time, which is near-linear

Assigning Weights to Minimize the Covering Radius in the Plane

1

Assigning weights to minimize the covering radius in the plane

Given a set P of n points in the plane and a multiset W of k weights with k <= n, we assign each weight in W to a distinct point in P to minimize the maximum weighted distance from the weighted center of P to any point in P. In this paper, we present an algorithm which takes O(k(2)n(2) log(3)n) time for the problem. We also consider the case that all weights in W are at most 1, and present an O(k(5)n log(3)k + kn log(3)n)-time algorithm. For a constant k, it takes only O(n log(3)n) time, which is near linear. (C) 2019 Elsevier B.V. All rights reserved.11Nsciescopu